if it has to be code use C++

For each of the following functions f(n), 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) milliseconds. 1) lg2n 2) n 3) nlgn 4) n2 5) n3 6) 2n 7) n ! Solve for time t of 1sec,1min,1 hour, 1 day, 1 month, and 1 year