Solve each of the following standard form linear programs by lower- and upper-bounded simplex Algorithm 5D, showing the basic inverse, the pricing vector, and update matrix E used at each iteration.

(a) The LP of Exercise 5-12 with added upper bounds xj … 3, j = 1,c, 5, starting with x1, x3, x5 basic and x2, x4 nonbasic upper-bounded.

(b) The LP of Exercise 5-13 with added upper bounds xj … 2, j = 1,c, 5, starting with x4, x5 basic and x1, x2 nonbasic upper-bounded.

(c) The LP of Exercise 5-14 with added upper bounds xj … 4, j = 1,c, 6, starting with x4, x5 basic and x1, x2, x3 nonbasic upper-bounded.