The running time of an algorithm is O(g(n)) if and only if(A) its worst-case running time is O(g(n)) and its best-case running time is Ω(g(n)).(O = big O)(B) its worst-case running time is Ω(g(n)) and its best-case running time is O(g(n)).(O = big O)(C) O(g(n)) = Ω(g(n))(O = big O)(D) O(g(n)) ∩ ω(g(n)) is non-empty set. (o = small o)Choose the correct answer from the options given below:

• A. (A) only
• B. (B) only
• C. (C) only
• D. (D) only