Can someone help me to solve this

In this quastion, consider the Matrix Chain Multiplication problern that we discussed in class. Finst, understand what is being asdoed to minimine in the problem. (a) Give the optimiaation objex:tive function that you will develop a narres. (b) Write: down the variables of your functivn in betwecen parenthesis and skefine what your function represents as comphetes and cxuncise as possible: in only ene sentennex, as we did in class. (c) We can start writing the right hand sides of the formuliation in a recursive manner. Now spend a considerable arnount of times to imagine how would an optimal splitting would look like for a set of matrives. Consider the last choice you would do to ohtain this imaginative optimal solution. Yes, you are right! You must chocese where to squlit. As you can guess, cach index k is a different sxenario. In the first scenario, assume that the number of operations to perform is minimisud if only you split from the first index (i.e. k=1 ). 'I'hen, if the last spit was at k=1, the right hand side: would be mone function of the function you have written for the corrusponding sub problem. Write down the right hand side for the first senario. (d) Write down the right hand siohe for k=2. As you can guess, you nosul to do this for all valid k2. (c) Now you are ruady to minimixe the set of all functions producrod by adifferent sxenarios. Write: down the whole formulation which colks:ts all the above right hand side: functions into one as a minimisation function