The following are the asymptotic growth rates as functions of the data size (n). 4n log(n) + 2n, 2^10, 2^log(n), 3n + 1001og(n), 4n, 2^10, n^2+ l0n, n^3, nlog{n) Write the Big-0 order of each of these growth rates Answer: Arrange these growth rates in ascending order (slowest to fastest)