Algorithm A: h=93n^5-57n^4-39n^2+11n-15

Algorithm B: k=2n log n+7 log n

Question:

the dominant term of h:_________

h is O____________

h is _________

h is __________

k is O__________

algorithm C always takes 1 hour to execute, regardless of input. It has time__________complexity

given tow real constants, a and b, and two functions f(n) and g(n), where ______________for all n__________, we say f(n) is O (g(n)).