in C only need help with answer part B

6] An algorithm has a count of basic operations C(n)=25n2log2(n). For a problem size 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 n the time it would take. Is it feasible? - Hint: We do not need cop because it will simplify in the ratio anyway! Solution: (b) What if we want to know the time for a basic operation, cop, after all? From the data 500, calculate cop. Solution