Algorithm A has work expressed by h = 93n^5 - 57n^4 - 39n^2 + 11n - 15. Please use ^ to represent exponentiation, as n2 is shown as n^2. Algorithm B has work expressed by k = 2nlog n + 7log n.

The dominant term of h is _____________. h is O ____________ h is ? ____________ h is ? ____________ k is O ____________. Algorithm C always takes 1 hour to execute, regardless of input. It has __________ complexity. Given two real constants, a and b, and two functions f(n) and g(n), where ______________ for all n ______________ we say f(n) is O ____________.

ANSWER CHOICES:

big little n 2logn 2nlogn 7logn nlogn logn unknown 93nA5 -57n 4 39n 2 11n -15 O(nA2) O(n) O(logn) O(nlogn) O(Ign) O(nlgn) >a variable b*g(n) >- f(n) b*g(n) -f(n) a"g(n)