Problem 3. Asymptotics Given an array A of n integers, you’d like to output a two-dimensional n \times n array B in which B[i, j] = max A[i], A[i + 1], . . . , A[j] for each i < j. For i >= j the value of B[i, j] can be left as is. for i = 1, 2, . . . , n for j = i + 1, . . . , n Compute the maximum of the entries A[i], A[i + 1], . . . , A[j]. Store the maximum value in B[i, j].