1. Put these functions in order so that if f(n)O(g(n)) (i.e. f(n) is Big-Oh of g(n) ), then f(n) appears before g(n) in the list. Group together functions that have the same asymptotic order of growth (i.e. f(n)g(n) ). In each case provide some justification to your claim. n2,nlogn,n3+logn,n,n2+2nlogn,loglogn,17logn,10n23,n5n4+2n,5n2loglogn,3n2+n3logn,n+6logn