Problem
1. True or false: If a matrix chain involves a 1-by-k by k-by-I multiplication, then there is an optimal solution for which that multiplication is last. Defend your answer.
2. Write a program to find the second best way to multiply together a chain of matrices.
3. Draw the optimal binary search tree for the example in the text, but with all the frequencies increased by one.