1. Consider the following function: Funci(A, i, j) /* A is an array of at least j integers 1 if (i 2j) then return (0); 2 nj-i+1; 3 k Random (n-1); 4 80; 5 for r i to j do /* n = number of elements from i to j */ 8 end 9 s s+Funci(A, i, i+k-1); 10 s s + Func1(A, i+k, j); 11 return (s); (a) What is the asymptotic worst case running time of Func1? (b) What is the asymptotic expected running time of Func1? Justify your solution