3. Sort is the following sorting algorithm, which you may assume is correct, called initially with i = 1 and j = n to sort a list of n numbers in array A Sort(A, i, j) if A[i]> A[j] then exchange A[i] => A[j] if i +12; then return kt L(j-i+1)/3] Sort(A, i, j - k) Sort(A, i + k, j) Sort(A, i, j - k) What asymptotic time-bound would be consistent with its running time C(n), as a function of the input size? Circle all that are true. (10 points) A C(n) = N(Ign) C(n) has linear growth C(n)= 0(n!) None of the above