3. Let n Є N \ {0}. Describe the largest set of values n for which you think 2" < n!. Use induction to prove that your description is correct. Here m! stands for m factorial, the product of first m positive integers. 4. Prove that log2 n! € O(n log n).

PLEASE HELP ME. kindly show all your work

3.  Let n ∈ N \ {0}. Describe the largest set of values n for which you think 2n < n!. Use induction to
prove that your description is correct.
Here m! stands for m factorial, the product of first m positive integers.

4. Prove that log2 n! ∈ O(n log2 n).

THANK YOU

3OoyQaGwGPYnEumugVXv