Hello, Big O notation proof, only need question 2 done. Please provide all work done to get the answer in legible writing. Thanks!!

c o0:s.mcgill.ca-hatami/cornp251-1201 //files/hw1.pdf ::: Apps math sn ver Rtracks R Forehonk Mrgil Mail p G ng erp " r mviesuggestions YouTube N Netflix netflix ranada soundnud G RIN and Sell Mens l pebeast O Homeland season converter . We say f = o(g) if and only if f(n) g(n) . We say f = w(g) if and only if g = o(f) Prove the following statements (a) VT1 + nym = 0(T12) (b) (n log2 n)5= (ns) (c) n! = 1 x 2 x x n = o(n") (d) log2 n=o(n1/100) 3. (20 points) True of False? (Prove or Disprove) 27+1 (a) 2 = 0(22") (b) (log2n)5-0(log:"5) (c) n1-6(1) (d) 2(log2 ")' - O(n100) 4. (15 points) Prove or disprove each one of the following statements Type, here to search :14 PM 914/2017