void func1 (int A[0..n-1]) { int a; if (n = 1) else { printline ("Take it easy!"); a = 1; while (an/2) { a = a *2; funcl (A[a..a + [n/2] - 1); } } (a-12 pts) Find a recurrence relation for number of lines the above function prints. (b-12) Solve the recurrence relation using backward substitution. (Find the exact value. You may assume that n is a power of 2)