Suppose that the following tableau occurs while solving a linear program in standard form us- ing the simplex algorithm, where A,B,C,D,E,F,G and H are all constants: Z X1 X2 X3 X4 Si S2 S3 1 A 0 0 D G 0 H 0 B 0 1 1 1 3 0 4.5 0 -2 1 0 2 E -1 0 2 0 -1 0 0 0 F 1 1 3 (a) What is the current CPF? (b) For each of the following situations, give values for A through H that would make the given condition true. X1) i. The current CPF is a unique optimal solution. ii. The current CPF is not optimal, the only candidate for entering the basis is s, and when the next iteration is performed, xz will leave the basis. iii. The current CPF is not optimal, the only candidate for entering the basis is. and the the problem is unbounded from above. iv. The current CPF is optimal, and there exists exactly one other CPF that is also optimal. v. The current CPF is optimal, and there also exists an extreme ray of alternative optimal solutions