Write the functions given to you as well as their asymptotic growth functions in terms of ) in increasing order of complexity. You don't need to write any proofs on top of this. Note that some of the functions might be of the same complexity, in that case write them on the same line. As we saw in class, in terms of asymptotics the base of the logarithm doesn't matter. For this class we will always assume it's base-2 logarithm, and will omit the subscript from the notation. Here is an example on the format: suppose that the functions are n+ 2, n + log n, n2 + log n, 3n, log n. Then you would write 1. log n = (log n) = 2. n + log n, 3n = O(n) 3. n +2, n+log n = P(n) = These are the functions you need to order: 1. n0.98898 log(n) 2. 1.00001" 3. 99n + vn log n . 4. log(2") log(n) 5. mm 6. 1.01. n log(n) 7. 1521 8. (29) 9. 22n 10. 2n/2 11. n! 12. 13. 2 - 3n2 14. Lizi 15. (n 1)