For each of the following expressions, give a simplified, tight big-O bound and order them by growth rate in ascending order:
(i) 10n² + 15n + 12nlog(n) + 0.999ⁿ
(ii) 20log(\(n^{2}\) + log²n
(iii) n¹⁰⁰ + (n – 10)!
(iv) 5*3²ⁿ + 7*2³ⁿ
(v) log(2ⁿ )+ log³n