Problem $1$ Solve the matrix$-$chain$-$multiplication instance with the following sizes.

You need to fill the following two tables for the opt and $\backslash (\backslash$pi $\backslash )$ values, give the minimum cost of the instance $($i$.$e$.,$ the number of multiplications$),$ and describe the best way to multiply the matrices $($using either a tree, or a formula with parenthesis$).$

Table $1$: opt and $\backslash (\backslash$pi $\backslash )$ values for the matrix chain multiplication instance.

The minimum cost for the instance is Describe the best way to multiple the matrices: Problem $1$ Solve the matrix$-$chain$-$multiplication instance with the following sizes.

You need to fill the following two tables for the opt and $\backslash (\backslash$pi $\backslash )$ values, give the minimum cost of the instance $($i$.$e$.,$ the number of multiplications$),$ and describe the best way to multiply the matrices $($using either a tree, or a formula with parenthesis$).$

Table $1$: opt and $\backslash (\backslash$pi $\backslash )$ values for the matrix chain multiplication instance.

The minimum cost for the instance is Describe the best way to multiple the matrices: