Help with Algorithms:

In the Longest Common Subsequence problem, in the bottom-up approach the solution built in a 2-Dimensional array, Cache[m+1][n+1]. The final solution was obtained by accessing which element of the cache? Cache[m][n] Cache[m][n+1] Cache[m+1][n+1] Cache[O][m] In which of the two approaches we start with the base case and proceed to solve the bigger subproblems? Top-Down Approach None of the options Both Bottom-up Approach