please answer the question below

Example 5.3.]. Consider the linear programming problem of Maximizing z = 11x1+4x2 +x3 +15x4 (5.3.1) subject to 3xl+ x2+2x3+4x4$28 3x1+212- x3+7x4$50 11,12,13J4 Z 0 Adding slack variables and then applying the simplex algorithm yields the reduced tableaux resolution shown in Table 5.5. The maximum value of z is 106, attained at the point (0,4,0, 6). Table 5.5 Q4 (2 points) Section 5.5 #2 (a) References Example 3.5.1 on page 8?. Determine the max value of the objective function and a point at which this value is attained if we make the specied change. 2. Consider the linear programming problem of Example 3.5.1 on page 87. De- termine the maximum value of the objective function and a point at which this value is attained if (a) b; is increased from 10 to 30 units, In and b3 remaining unchanged