Find the complete optimal solution to this linear programming problem.
Min 3X + 4Y
s.t. 12X + 4Y > 48
4X + 8Y > 32
X, Y > 0
a. Graph to show each constraint and the feasible region. Provide graph on separate page.
b. Identify the optimal solution point on your graph. What are the values of X and Y at the optimal solution? X=____________, Y=_______________
c. What is the optimal value of the objective function?