A,B, and C

1) (15 points)a) walk through recursive algorithm below to compute T(5). Show your work. T(positive integer n) if n=1 else if else return 1 return 4 return 3 + T (n-1)+ T (n-2) n=2 b) How many times is the function invoked to compute T(5). c) Let A(n) represent number of additions done by recursive algorithm T. Write the recurrence relation for A(n)