Consider the following linear program P with two resources and three activities. The resources are in the amounts of 20 and 90 and the activities are represented by the three decision variables. Maximize Z=-5x + 5x2 + 13x3 (0) subject to -x1 + x2 + 3x3 0, x2 > 0, x3 > 0. Let x4 and xs denote the slack variable for functional constraint (1) and (2), respectively. After we apply the simplex method, the final simplex tableau is Coefficient of Basic Variable Z Eq. (0) Z 1 xi 0 X2 0 X3 2 X4 5 X5 0 Right Side 100 0 X2 (1) 0 -1 1 3 1 0 20 X5 (2) 0 16 0 -2 -4 1 10 Answer the following independent questions: (a) Write the optimal solution of P, i.e. values of all variables (original and slack) and z- value and the optimal solution of its dual (dual variables, surplus and dual objective value). (1)The above is the optimal basic solution of Problem P. What is the upper bound on the number of basic solutions in this