show the mechanical steps not the table method please Consider the following linear optimization model:(P)maxs.t.x1 + 2x₂-x1 + x₂ ≤ 6x12x₂ < 4X1, X2 ≥ 0. Use the simplex algorithm (starting from the basis composed of slack variables) to show that (P) isunbounded. When multiple variables are eligible to enter the basis, select the eligible variable withhighest reduced cost. If multiple variables are eligible to leave the basis, select the eligible variablewhose index is smallest. (When providing an answer to this problem, report (at least) the simplexdictionary obtained at each iteration, and state what variables are entering/leaving the basis.)

Given Information:The Linear programming model is given as follows:Subject to the constraints:To find:The solution to the LPP using Mechanical steps.Concept used:The mechanical approach involves using mathematical algorithms, such as the simplex method, to find the optimal solution of the LPP. No mechanical steps (LPP algorithm) can be solved without constructing table.If the inequality on the constraint is as, then introduce the positive variable which is termed as slack variable.If the inequality on the constraint is as , then introduce the negative variable which is termed as surplus variable.As replace the inequality , introduce the slack variable.Now, the standard form of LPP after introducing slack variables as:Maximize .Subject to the constraints:Initial Simplex Table:00Basic VariableMinimum Ratio0604-000The negative most net evaluation corresponds to the variable .So, the variable enters the basis.As the minimum ratio corresponds to the variable , the variable leaves the basis.In this stage, the basic solution becomes .Iteration 1:Perform the row operations:1200Basic VariableMinimum Ratio26110-0021-020In this stage, the solution is .The negative net evaluation corresponds to .So, is required to enter the basis.As the entry on column are negative, the ratio doesn't exist and hence no element can able to leave the basis.So, the solution to the LPP is unbounded.There is no element that leaves the basis in final iteration, the solution to the LPP is unbounded.