Explain why

12101 004 1152 51s kesesrei Kt ine Warcisi11 Home Albert Galuego My Institution Content Collection H ecture 7 his item does not open automatically you can open Lecture 7 here Exercise Which of the following statements is/are valid? I. For any two functions f (n) and g (n) , we have f (n) - (g (n) ) fand only if f (n) -O(g(n)) and f (n) -0(g (n)). 2. Time complexity of all computer algorithms can be written as ( 1 ) 3. O(cf (n)) O(f (n)) 4. O(f(n)) + 0(g (n)) = 0(f (n) ir g (n) 5.0(f(n)) 0(g(n)) #: to(f (n) g(n)) 6. 5n2 is () 7 . 5 is (n) 8. 5n is (n) Exercise What does it mean when we say that an algorithm X is asymptotically more efficient than Y