Let the following current tableau of a maximization problem with slack variables S1, S2, S3. Z X1 X2 X3 $1 $2 $3 RHS 1 0 a b C 0 0 m 0 1 d e f 0 0 n 0 0 g h i 1 0 0 0 j k 0 1 P d) Let x3 is entering the basis and let e,h,k≤ 0. What type problem is this? e) Let a=0, b=3, c=5, is the solution optimal? If x₂ enters the basis does the objective function value change? Why? f) Let x2 is entering the basis and s3 is leaving the basis. Let n=3, 0-6 and p=0. In the new tableau it is seen that the value of m is same. Why do you think the objective function value did not improve?