Question: For the matrices A1, A2, A3, A4, A5, and A6 with sizes use Dynamic Programming to define the minimal number of floating point multiplications to calculate the product of the matrix chain A1.A2.A3.A4.A5.A6. a) Write out a recursive formula for the calculation of the optimal complexity. (3 points) b) What two matrices are to be filled? What do they contain? What are the sizes of the matrices? How they are to be initialized? In what order their elements are to be filled? ( 5 points) c) Fill in the matrices. (7 points) d) What is the minimal computational complexity of the matrix chain? (1 points) e) Show the optimal parenthesization. (4 points)