Q1.

a) Use mathematical induction to prove that log₂n n for all integers n 1.

b) notations are also used for functions defined on the set of non-negative integers (ie, sequences). Use the result in part (a) to show that :

3n + log₂n is (n). Show and explain your reasoning. Thanks