The following are the asymptotic growth rates as functions of the data size (n). 2n - 100nlogn, 10^1000, 2^log(n), 3n + 100 log(n), 8n, 2^n, n^2 + 10n, n^3, nlog(n^2) Write the Big-O order of each of these growth rates Arrange these growth rates in ascending order (slowest to fastest)