4. Simplex Method (20 marks) Solve each of the following LPs using the simplex method. Each LP below is in canonical form for some feasible basis B (which you should be able to identify by inspection); start the simplex algorithm from this basis. Use Bland's rule: break any ties in the choice of the entering and leaving variable by picking the one with the smallest indent. Show all your steps. (When running the simplex method, as noted earlier, to obtain the canonical form for a basis, it is typically more efcient to apply row operations to the canonical form for the previous basis, rather than compute A31 and apply the formula in the text.) (a) max (0, 0, 1,9, 4):c + 4 subject to 1 0 1 2 3 3 (0 1 3 1 5)"'=(1) a: 2 D (8 marks) (13) max (0,0,0,4,1)x 3 subject to