Asymptotic notation, algorithm design 1. Order the following ten functions by the big-Oh notation. Group together those functions that are big-Theta of one another. Justify your ordering briefly, in each case. Note. The first in the list should be the one that grows most slowly. If these functions repre- sent running times, then the first function or group would characterize the fastest algorithm; see if you can make sense of this or ask questions Hint. First simplify the functions if possible; then split the functions in 3 or more classes such as polylogarithmic, polynomial, and exponential; then refine the order in each class. ible; then split the functions in 3 or classes, 3n5n333.3" 2n log n