1. Solve the recurrence relation subject to the basis step S(1)=1S(n)=S(n1)+(2n1)forn2 See Example 14 in Section 2.2 2. Solve the recurrence relation subject to the basis step S(1)=1S(n)=nS(n1)+n!forn2 3. Solve the recurrence relation subject to the initial conditions A(1)=7A(2)=18A(n)=6A(n1)8A(n2)forn3 4. Solve the recurrence relation subject to the initial conditions; the solutions involve complex numbers S(1)=4S(2)=8S(n)=4S(n1)5S(n2)forn3 5. Solve the recurrence relation subject to the basis step. (Hint: See Example 15 in Section 2.2, and note that 2logn=n.) T(1)=3 T(n)=T(2n)+nforn2,n=2m