Please show workings

Suppose you have algorithms with the three running times listed below. (Assume these are the exact number of operations performed as a function of the input size n.) Suppose you have a computer that can perform 106 operations per second, and you need to compute a result in at most ten minutes of computation. For each of the algorithms, what is the largest input size n for which you would be able to get the result within ten minutes? (a) g(n)=2n(logn) (b) g(n)=(n!) 1 (c) g(n)=(nk), for k=4; and then for k=6. Recall that (nk)=k!(nk)!n