If f(n) = O(g(n)), which of the following statements is true?g(n) grows faster than f(n) as n increasesf(n) grows faster than g(n) as n increasesf(n) and g(n) grow at the same rate as n increasesNone of the above

Which of the following is the correct order of growth from fastest to slowest?O(1), O(n), O(n log n), O(n^2)O(n^2), O(n log n), O(n), O(1)O(n log n), O(n), O(1), O(n^2)O(n), O(1), O(n^2), O(n log n)

Which of the following is false on two positive functions f and g?A. if f = ⇥ (g), then g = ⌦ (f )B. if f = ⇥ (g), then g = ⇥ (f )C. if f = ⇥ (g), then g = O(f )D. none of them.

Which of the following statements is FALSE about Big O notation?Group of answer choicesIt can be used to compare the efficiency of different algorithmsIt ignores constant factors.It considers only the dominant/leading term as the input size grows.It represents the worst-case time complexity.

Which of the following time complexities indicates the slowest growing function?O(n!)O(2^n)O(n^3)O(n log n)

For each of the following statements, mark in the answer sheets whether the statement istrue or false.(a) Let f and g be positive functions. Then, f (n) + g(n) ∈ O(n) implies that f ∈ O(n)and g ∈ O(n).(b) There exist functions f, g ∈ Ω(n) such that f − g ∈ Ω(g) and 2g − f ∈ Ω(f ).