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. (50pt)\ \\\\table[[,1 second,1 minute,1 hour,1 day,1 month],[

logn

,,,,,],[

\\\\sqrt(n)

,,,,,],[

n

,,,,,],[

nlogn

,,,,,],[

n^(2)

,,,,,],[

n^(3)

,,,,,],[

2^(n)

,,,,,],[

n!

,,,,,]]\ (Extra 10pt) write a program in Java/C/C+/Python (any programming language you are familiar with) to calculate times for each of the algorithms (functions). You will need to submit a source

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. (50pt) (Extra 10pt) write a program in Java/C/C+/Python (any programming language you are familiar with) to calculate times for each of the algorithms (functions). You will need to submit a source