Consider the following game. A dealer produces a sequence s1 sn of cards, face up, where each card si has a value vi. Then two players take turns picking a card from the sequence, but
can only pick the rst or the last card of the (remaining) sequence. The goal is to collect cards of
largest total value. (For example, you can think of the cards as bills of different denominations.)
Assume n is even.

Give an O(n^2) algorithm to compute an optimal strategy for the rst player. Given the
initial sequence, your algorithm should precompute in O(n^2) time some information, and
then the rst player should be able to make each move optimally in O(1) time by looking
up the precomputed information.