Please show work for how you reached answers for the different parts. Thanks!

Find a solution to the following linear program using the graphical technique: max z = x1 + 3×2 s.t 2×1 + x2 lessthanorequalto 6 (1) x1 + 2×2 lessthanorequalto 6 (2) x1 + x2 lessthanorequalto 5 (3) x1 greaterthanorequalto 0 (4) x2 greaterthanorequalto 0 (5) a) Graph the problem and shade in the feasible region. Label the axes and all constraints. b) Label all basic feasible solutions. How many are there? For each basic feasible solution indicate 1) Which variables are basic and which are nonbasic. 2) The value of each variable. c) What are the x_1 and x_2 coordinates of the optimal solution? d) What is the z-value of the optimal solution? e) Which constraints are binding? Which are nonbinding?