Consider the following recursive model:

$x_{n+1}=-0\mathrm{.}03x_n^2+Y_n$

$Y_{n+1}=9\mathrm{.}75-0\mathrm{.}8x_n$

$4\mathrm{.}1.$ Convert this $2-$variable memory $1$ system into $1-$variable memory $2$ system $(+6$ points$).$

$4\mathrm{.}2.$ Calculate all steady state solutions of the system $(+7$ points$).$

$4\mathrm{.}3.$ Starting with $x_1=0$ and $x_2=0,$ find $x_3,x_4,$ and so on up to $x_{100}.$

Display your results as $x_n$ vs $n$ graph $(+7$ points$).$

Tip: write a simple MALTAB script with a for$-$loop.