Q2(A): Using Brute force, Find the best order, i.e., optimal parenthesization and minimum cost (smallest number of operations) for multiplying the following matrixes (7.5 points): $$ \mathrm{B}(3,5), \mathrm{C}(5,3), \mathrm{D}(3,3) $$ Q2(B): Using Dynamic programming, Find the best order, i.e., optimal parenthesization and minimum cost (smallest number of operations) for multiplying the following matrixes (7.5 points): $\mathrm{A}_{1}(3,5) ; \quad \mathrm{A}_{2}(5,3) ; \quad \mathrm{A}_{3} (3,2) ; \quad \mathrm{A}_{4}(2,8) ; \quad \mathrm{A}_{5} (8,2) ;$ CS.VS. 1025