Hello tutor, I am looking for your explanation behind these answer. Please be clear and show your working. Thank you

1. Graphical Solution Method: Consider the following constraints and the corresponding graph below: dx-y=>1 Constraint 1 xty0 Non-Negativity 0 1 2 3 4 5 6 7 8 a. Shade the feasible region in the graph provided above. b. For this part only, the objective function is Minimize x + y. Which of the following describes the optimal solution? (Circle the correct answer) Infeasible Unique Alternate Unbounded c. For this part only, if the objective function is Minimize -3x + y, then what is the optimal solution? Put your answer in the space below for x and y. x = y= d. For this part only, consider Constraint 1 removed and therefore does not need to be satisfied. If the objective function is Maximize 3x + 6y, then what is the optimal value