Give a recursive algorithm MATRIX$-$CHAIN$-$MULTIPLY $(A,s,i,j)$ that actually performs the optimal matrix$-$chain multiplication, given the sequence of matrices $($:$A_1,A_2,$dots,$A_n$:$),$ the $s$ table computed by MATRIX$-$CHAIN$-$ORDER, and the indices i and $j.($The initial call is Matrix$-$Chain$-$Multiply $(A,s,1,n).)$ Assume that the call RECTANGULAR$-$MATRIX$-$MULTiPlY $(A,B)$ returns the product of matrices A and $B.$