3) Consider the three-dimensional LP solution space in gure 3.4 (on page 78 of textbook), Whose feasible extreme points are A, B, ..., and J. 21) Which of the following pairs of corner points cannot represent successive simplex iterations: (A, B), (B, D), (E, H), and (A, 1)? Explain the reason. b) Suppose that the simplex iterations start at A and that the optimum occurs at H. Indicate Whether any of the following paths are not legitimate for the simplex algorithm, and state the reason. i)A>B>G>H. ii)A>E>I>H. iii)A>C>E>B>A>D>G>H