QUESTION 3 Order the following functions in increasing order of asymptotic complexity, from smallest to largest n! 3ln(n) QUESTION 4 Consider the following function: int A(int n) ! if (n == 1) return 1; else return A(n-1) * A(n-1); } Let the run time performance for an input n be T(n). Which of the followng is true? 2 Ob. T(n) + V(n) T(n) E O(log(n)) T(n) E (2") "T(n) E O(n) Oc O d