Sylvester's Sequence is defined as: Si = s-1 - 841 +1 with so = 2. (a) Set up, and solve, a recurrence relation to calculate the number of additions and subtrac- tions carried out in the computation of the nth number in Sylvester's Sequence, given this recursive definition. (b) It has been shown that the growth of Sylvester's Sequence is doubly exponential, with the closed form formula: Sn = | E2n+1 + 1] with E ~ 1.2640847. Prove that the growth of Sylvester's Sequence is at least 2 (10")