Q$3$: Consider:

Answer the following questions:

a$)$ Write a recursive algorithm for the function and find its time complexity.

b$)$ Write a memoized algorithm for the function and find its time complexity.

c$)$ Write a dynamic$-$programming algorithm for the function and find its time complexity.

d$)$ Which one is better to use for this problem: recursive, memoized, or dynamicprogramming? Justify your answer.

Q$4$: Find an optimal parenthesization of a matrix$-$chain product whose sequence of dimensions is Show the $m$ and $s$ matrices and the final suggested parenthesization.