Menu

1 6 Points Assuming Fi N O Gi N F2 N O G2 N Drozdek P71 2 Points Prove Fi N F2 N O Max Gi Q43842337

1. (6 points) Assuming that fi(n) is O(gi(n)) and f2(n) is O(g2(n)): (Drozdek, p.71) a. (2 points) Prove that fi(n) + f2(n) i

1. (6 points) Assuming that fi(n) is O(gi(n)) and f2(n) is O(g2(n)): (Drozdek, p.71) a. (2 points) Prove that fi(n) + f2(n) is O(max(gi(n), g2(n)). b. (2 points) Prove that fi(n) * f2(n) is O(gi(n) * g2(n)). c. (1 point) Find a counterexample to refute that fi(n) – f2(n) is O(gi(n) – g2(n)). d. (1 point)Find a counterexample to refute that fi(n)/f:(n) is O(gi(n) /g2(n)). Show transcribed image text 1. (6 points) Assuming that fi(n) is O(gi(n)) and f2(n) is O(g2(n)): (Drozdek, p.71) a. (2 points) Prove that fi(n) + f2(n) is O(max(gi(n), g2(n)). b. (2 points) Prove that fi(n) * f2(n) is O(gi(n) * g2(n)). c. (1 point) Find a counterexample to refute that fi(n) – f2(n) is O(gi(n) – g2(n)). d. (1 point)Find a counterexample to refute that fi(n)/f:(n) is O(gi(n) /g2(n)).

Expert Answer


Answer to 1. (6 points) Assuming that fi(n) is O(gi(n)) and f2(n) is O(g2(n)): (Drozdek, p.71) a. (2 points) Prove that fi(n) + f2…

OR