please do not copy same answer on chegg

Professor's Howard, Fine, and Howard have proposed the following elegant sorting algo- rithm, which they call the HowardFine Sort. Here is their pseudo-code: Howard Fine (int* A, int i, int j) { if (A[i] > A[j]) { swap (A[i], A[j]); } if (i + 1 >= j) { return; } int k = floor ((j - i + 1)/3); HowardFine (A, i, j - k); /* Sort the first two-thirds */ Howard Fine (A, i + k, j); /* Sort the last two-thirds */ HowardFine (A, i, j - k); /* Sort the first two-thirds */ } 10. (5 points) What recurrence equation and initial condition describes the worst-case run- ning time of the How dFine? Assume the array A has length n, and that n is a power of 3/2, that is, n = ()' or p = log1.5(n) for some p. 11. (5 points) Solve your recurrence relation to find the worst-case running time of the HowardFine Sort. Please solve the recurrence relation found to find the time complexity O(n) T(n) = 3T n +C, 3