Reorder the list of the functions below, by which grows the slowest (i.e. if these were bounds on running times of an algorithm which takes the least amount of time to run for n items) to the one that grows the fastest:
n, n2, n3, n0.5, 2n,
n!, lg n, n lg n
Hint: You might find a graphing calculator, such as Desmos helpful.