Do Exercise $1.$b on p$\mathrm{.}395.$ Use the matrix multiplication algorithms in Handout $9$ to determine the most efficient order to multiply the matrices. Show the combined cost and trace arrays, and the order of multiplication, as derived by getOrder. I do not want a code!!! answer format: $=//$ Matrix Multiplication Order matFill$($s$,$ n$)$ for$($i $=1$; i $<$ n; i$++)$ cost$[$i$][$i$]=0$ for$($span $=2$; span $<$ n; span$++)$ for$($i $=1$; i sn$-$span $+1$; i$++)$ val $==00=$ i $+$ span $-11$ for$($p $=1$; p $<1-1$; p$++)$ z $=$ cost$[$i$][$p$]+$ cost$[$p $+1][]+$ s$[$i$]*$ ssp $+1]*$ s$[]+1]$ if$($z $<$ val$)$ val $=$ Z split $=$p cost$[$i$][$j$]=$ val trace$[110]=$ split $==//$ Trace Order in an Array getOrder$($trace$,$ s$,$ e$)$ if$($s