matrix chain multiplication optimcal cost added as dynamic solution
Use dynamic programming to partition text with minimum cost.
ttt
tMerge branch 'master' of https://github.com/mstepan/incubator.git

Conflicts:
	algorithms/src/main/java/com/max/algs/AlgorithmsMain.java
	algorithms/src/main/java/com/max/algs/dynamic/MatrixChainMultiplication.java
	algorithms/src/test/java/com/max/algs/dynamic/MatrixChainMultiplicationTest.java