Consider the primal linear programming problem below. \begin{aligned} &\text { Maximise } 8 x_{1}+10 x_{2}+8 x_{3}\\ &\text { subject to }\\ &8 x_{1}+6 x_{2}+3 x_{3} \leq 12\\ &6 x_{1}+12 x_{2}+16

x_{3} \leq 20\\ &x_{1}, x_{2}, x_{3} \geq 0 \end{aligned} a) Construct the dual problem and solve it graphically. b) Determine a solution to the primal problem, stating clearly any results that youuse (do not use the simplex algorithm).