Make algorithm on the tables,especially the

I want the steps in detail for these equations (n log n) and n!

R-1.8 For each function f(n) and time t in the following table, determine the largest size n of a problem that can be solved in time t assuming that the algorithm to solve the problem takes f(n) microseconds. Recall that log n denotes the logarithm in base 2 of n. Some entries have already been completed to get you started. 1 Second Mont Century logn 0300000 Vn n log n n2 n3 1l 2" n! 12