algorithm , please

Q1) A. Prove or disprove (2 Pts.) 1. If f(n) is O(g(n)). Is then 2tin) = 0 (2 8(nl)? 2. f(n) = O(g(n)), then g(n) = O(f(n)). 3. nk = (2) 4. log(n!) = (nlogn) B) In each of the following situations, indicate whether f = O(g), or f = 2(g), or both f = o(s). (2 Pts.) 1. f(n) = 100n + log n and g(n) = n + (log n)? 2. f(n) = n 1.01 and g(n) = n log n. 3. f(n) = n1/2 and g(n) = 4logn 4. f(n) = 2" and g(n) = 2n+1. Q2. (2 A. Find the time recurrence equation and the complexity pts.) 1. int Fun1(int n) { if (n