An algorithm has a count of basic operations C(n) = 25n²log₂(n). For a problem size n = 500, the program implementing the algorithm was timed and found to run in 5 minutes. (a) Your boss is asking to run the program for a problem size n = 100,000 on the same machine. Estimate the time it would take. Is it feasible?

(b) What if we want to know the time for a basic operation, cop, after all? From the data we have for n = 500, calculate cop.