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) milliseconds. Make reasonable efforts to show your work to get full points.

f (n) \ t	1 second	1 minute	1 hour	1 day	1 month
logn
n
nlogn
n2
n3
2n
n!

Also, write a program in Java/C/C++/Python (a programming language that you are familiar with) to calculate times for each of the algorithms (functions). You will need to submit a source code along with the screen shot of the execution result showing the largest size n of each algorithm (function) that can be solved in time t (50pt).

Please share the python code and note the question in milliseconds.