Ans - D)
h = n! , can also be written as
h = nn (a weak upper bound on the factorial function n! <= nn , as each of the n terms in the factorial product is at most n ).
This eliminates options A AND B.
And by using log property on g(n) , we observe that f(n) and g(n) vary by just a constant term of 3.
Thus this gives us the answer D.