The time complexity to find and record the order of the optimal

The time complexity to find and record the order of the optimal way to compute the multiplications of $$M_{1}\times M_{2}\times ... \times M_{n}$$ is $$O(n^{3})$$ where $$n$$ is the number of matrices. ~@[](2)

答案：TRUE