What is the time complexity of finding the minimum number of scalar multiplications needed for $A_1A_2\ldots A_n$ using dynamic programming?