Please solve and write steps to each run,ti km e of the following recursive definitions.

What is the run-time of the following recursive definitions 1 if n=1 a. 1 if n=1 T(n)= LT(n-1)+n if n>1 b. 1 if n=1 T(n)= LT(n-1) + 2 C. T(n)= . n=1 2T(n/2) +n n>1