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 log n). 1. Prove that Vk Є N, 1k+2k + ·+nk € © (nk+1). 2. Suppose that the functions f₁, f2, 91, 92 : N → R≥º are such that ƒ1 € ☹(91) and ƒ2 € ☹(92). Prove that (fi + ƒ2) € ©(max{91, 92}). Here (f1f2)(n) = fi(n) + ƒ₂(n) and max{91, 92}(n) = max{91(n), 92(n)}.

Please help me with these questions. I am having trouble understanding what to do. Please show all your work on paper

Thank you