Could you please help me to solve the problem. Also, could you please answer questions in clear hand-writing and show me the full process, thank you (Sometimes I get the answer which was difficult to read).Thanks a lot

1. 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.

t=1 sec

log(n)=?

n =?

nlogn =?

n^2 =?

n^3 =?

2^n =?

n! =?