it's limited time quiiz !

Q1)Compare the order of growth of f(n)=19n(n2+3nlog(n)+n) and g(n)=9n3 as n approaches infinity

Select the TRUE statement.

Group of answer choices

f(n)=O(g(n))

g(n)=O(f(n))

f(n)=(g(n))

Q2)mutiple choice ---

Select ALL statements that are true about Mergesort.

-The recurrence relation for the running time of Mergesort is:

T(n)=2T(n2)+O(n),n>1

-The combine step of Mergesort can be done in-place

-The merge step requires O(n) additional space

-The worst-case time complexity of Mergesort is O(nlogn)

The best-case time complexity of Mergesort is O(nlogn)