Please do not copy same answer already uploaded 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 i) { 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 Howard Fine (A, i, j - k); /* Sort the first two-thirds */ } */ 11. (5 points) Solve your recurrence relation to find the the worst-case running time of the HowardFine Sort