5. Suppose for the linear programming problem Maximize z = c³x subject to Ax ≤ b x ≥ 0, we know that b = [12 21 8 2 5]T. Assume that w = [0 4 5 0 3]T is an optimal solution to the dual of the given problem. Calculate the optimal value of the objective function for the given problem.