Recall that given two functions f y R rightarrow R we say th

Recall that, given two functions f, y: R rightarrow R, we say that f is O(g(n)) if c, n_o R^+ (n greaterthanorequalto n_o(f(n) lessthanorequalto c g(n))). Similarly, we say that f is ohm (g(n)) if O(g(n)) if c, n_o R^+ (n greaterthanorequalto n_o(f(n) lessthanorequalto c g(n))). Finally, we say that f is Theta (g(n)) if it is both O(g(n)) and ohm (g(n)). Suppose that an algorithm uses 7n^3 + 4^n elementary operations to solve a problem of size n. Suppose that your machine can perform one bit operation in 10^-9 seconds, how long does it take your algorithm to solve a problem of size given below. Note, if your algorithm takes more than 60 seconds, answer in minutes. For more than 60 minutes, answer in hours. For more than 24 hours, answer in days. For more than 365 days, answer in years. For more than 100 wars, answer in centuries! 10 20 50

Solution

The question is incomplete, it doesn\'t provide the date for the value of n or the problem size

Time taken in seconds to finish the task

=> (7n^3 + 4^n) * 10^(-9)

the value of n should be given to compute the final answer, depending on the answer we can round off it in minutes,hours,days,months or years