And of course, after the two for loops complete, what we really care about is the answer in A of one comma n, that is the optimal binary search tree value for all of the items that's the eventual output. 