Q1) Consider the following six functions. They are the running times of six algorithms. Arrange them in ascending order of asymptotic running time, and give an explanation of your ordering. (n) 12n3 + n2log (n) (n) 48 v/(n + 45) + log(n) fs(n) 3 log(n2) f4(n) 3n 100n fs(n)2log(n) &Cn) 150000 6(2)- Q1) Consider the following six functions. They are the running times of six algorithms. Arrange them in ascending order of asymptotic running time, and give an explanation of your ordering. (n) 12n3 + n2log (n) (n) 48 v/(n + 45) + log(n) fs(n) 3 log(n2) f4(n) 3n 100n fs(n)2log(n) &Cn) 150000 6(2)