Add Matrix Chain Multiplication in DP

In the dynamic programming section, we could add the Matrix Chain Multiplication problem which is quite famous to find the most efficient way to multiply matrices together. The problem is not actually to perform the multiplications, but merely to decide in which order to perform the multiplications.