Matrix Chain Multiplication DP considers all k splits of [i,j] and takes min over cost(i,k) + cost(k+1,j) + cost of multiplying two _____ matrices.