Q2 [10 marks] In this exercise we practise the Simplex method. Show the rst two iterations of the Simplex Method with input LP max{cT:c : A0: = {1,32 2 0} Where 1 10011 1 1 A=01001,b=1,c=1, 00110 1 3 1 and initial feasible basis B = {1, 2, 3}. In each iteration, show your detailed work and the outcome after each iteration. If there are multiple choices for entries leaving or entering the basis, use Bland's rule