18.2-2. Use parametric linear programming to find the optimal so- lution for the following problem as a function of 0, for 0≤0≤20. Maximize subject to G Z(0)=(20+40)x1 + (30-30)x2 + 5x3, 3x + 3x2 + xz 30 8x1 + 6x2 + 4x3 ≤75 6x1 + x2 + x3 = 45 and 20 82≥0. and X1 xj Then of Z( 8.2-6 to fin (Hin 8.2- line x≥0. (a) Problem 8.2-2. Replace the instructions with this: Carry out one iteration past the initial tableau, assuming that is generic but small. After the one iteration, what basic feasible solution have you reached? For what range of values 0≤ 00max is this basic feasible solution optimal?