Dynamic programming can be used to solve the matrix-chain multiplication problem. Suppose we hope to compute the matrix product $A_1A_2\ldots A_6$ with the matrix dimensions as follows.

Let $m[i,j]$ be the minimum number of scalar multiplications needed to compute the matrix $A_iA_{i+1}\ldots A_j$. What is $m[2,5]$? (A) 4375 (B) 7125 (C) 5375 (D) 8500 (E) none of the other choices