Give an example which shows that in the matrix chain multiplication problem, adding a matrix on the right can force the breakpoint to the left. You can find an example using just 4 matrices. This shows that the trick used to speed up optimal binary search tree computation cannot be used for matrix chain multiplication.