Find an optimal parenthesization $($ordering$)$ of a matrix$-$chain product A$1$A$2$A$3$A$4$A$5,$ whose se$-$

quence of dimensions is p $=(5,6,3,7,5,3).$

$($a$)$ Compute the dynamic programming m$-$table and s$-$table.

$($b$)$ Show the optimal parenthesization $($ordering$)$ from computed s$-$stable.