I only need to do Part (a). Please help me solve this problemand show every step!!.Please be specific on how you obtain the approximate linearprogramming model. 13.8-9. Consider the following convex programming problem: Maximize \( Z=32 x_{1}-x_{1}^{4}+4 x_{2}-x_{2}^{2} \), subject to \[ x_{1}^{2}+x_{2}^{2} \leq 9 \] and \[ x_{1} \geq 0, \quad x_{2} \geq 0 . 1 answer