Help would be appreciated with this problem

Brute Force and Exclude & Conquer Recursive Algorithms In the following problems, use the General Solution of 1st Order Linear Recurrence T(n)= a, T(n-1)+ bn, given T(0) or T(1) with the following solutions: Successive substitution gives for the cases of T(0) given and T(1) given: T(n)=T(0) la; + Eb; II a;+b. T(n)=T(1) IIa, + Eb II a;+by i=/ i=1 j=i+1 i=2 i=2 j=i+1 1. Solve the following linear recurrences (20 point): a)T(n) = T(n-1) + logn for n > 1 with T(1) = 0) b)T(n) = 2T(n-1) + 2" 2T(n-1) + 2" for n > 0) with T(0) = 1