Q. An algorithm is made up of two independent time complexities f (n) and g (n). Then the complexities of the algorithm is in the order of

• (A) f(n) x g(n)
• (B) max ( f(n),g(n))
• (C) min (f(n),g(n))
• (D) f(n) + g(n)