3.1 Given a time function, T(n) 5n2+2n+3, find constants c and N that prove that the big O of T(n) is n2 3.2 Find the Big O of T(n) 2n3+10n2+n+6. Justify your answer by finding constants c and N 3.3 Find the Big O of the following code: for(int i 0;