Question: 3. (25 points) A program is shown below. What are its recurrence relation T(n) and the big O notation of T(n)? long Pow (long i,

3. (25 points) A program is shown below. What are its recurrence relation T(n) and the big O notation of T(n)? long Pow (long i, long n) if (n==0) return 1; else return i* Pow (i, n-1) (Note that you need to find T(n), NOT T(i, n) or T(i))
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
