1. There are n(n+1)/2 = O(n^2) subproblems. Recursive formula: F(r,r) = A[r] F(r,s) = F(r,s-1) and A[s] if r