This a question on algorithm and has two parts. Please read carefully and answer them. Thank you.

Question 1 (8+8 points): Prove by induction that (show all steps): Palog i = (n lg n) (b) Compare and establish the tightest possible asymptotic relationship between the two functions using one of the five notations: 0, , , o, w. 3 n and n