Sort the following functions in increasing order of growth following the Big-O notation ( NB: There is no need typing the functions, just use the labels (a) to (h) to sort the functions accordingly.)...

Sort the following functions in increasing order of growth following the Big-O notation

(NB: There is no need typing the functions, just use the labels (a) to (h) to sort the functions accordingly.)

a. log log log(n)

b. n³
log(n)

c. 4.5⁽ⁿ⁾

d. 3⁽ⁿ⁾

e. n⁽⁴⁾
log(n)

f. log log(n)

g. 4.5n + log(n)

h. 3⁽⁵⁰⁰⁾