[Solved]4 35 Points 5 Points Part Prove Following Claims Parts F Use Either Definitions Big O Big Q37176712

Please help. I would really appreciate if someone can answer allquestion a through g.

4. (35 points – 5 points for each part) Prove the following claims. For parts (a)-(f), use either the definitions (of Big-O, Big-2, or Big-) or a limit argument. For part (g), use the definition of Big-2 and induction. (a.) 2 E O(n!) (b.) log2(n) E O(n/log2(n)) (c.) log2(n2)+ log2(100n10) E O(log2(n) (d.) n/2 E O(n2/8) 3 (e.) logs(n) E Θ(log2(n)) (f.) 2″ O(3″/n2) (g) Recall that the Fibonacci sequence is defined recursively as Fo = 0,F1 = 1, and = Ω((VE)”) Fn-1 + F,,-2 for n > 2. Prove that Fn Show transcribed image text 4. (35 points – 5 points for each part) Prove the following claims. For parts (a)-(f), use either the definitions (of Big-O, Big-2, or Big-) or a limit argument. For part (g), use the definition of Big-2 and induction. (a.) 2 E O(n!) (b.) log2(n) E O(n/log2(n)) (c.) log2(n2)+ log2(100n10) E O(log2(n) (d.) n/2 E O(n2/8) 3 (e.) logs(n) E Θ(log2(n)) (f.) 2″ O(3″/n2) (g) Recall that the Fibonacci sequence is defined recursively as Fo = 0,F1 = 1, and = Ω((VE)”) Fn-1 + F,,-2 for n > 2. Prove that Fn

Expert Answer

---

Answer to 4. (35 points – 5 points for each part) Prove the following claims. For parts (a)-(f), use either the definitions (of Bi… . . .