Consider the following game. a dealer produces a sequence s1 sn of cards, face up, whereeach card si has a value vi. then two players take turns picking a card from the sequence, butcan only pick the first or the last card of the (remaining) sequence. the goal is to collect cards oflargest total value. (for example, you can think of the cards as bills of different denominations.)assume n is even.

(a) show a sequence of cards such that it is not optimal for the first player to start by pickingup the available card of larger value. that is, the natural greedy strategy is suboptimal.
(b) give an o(n2) algorithm to compute an optimal strategy for the first player. given theinitial sequence, your algorithm should precompute in o(n2) time some information, andthen the first player should be able to make each move optimally in o(1) time by lookingup the precomputed information.