Question 1 Let a(n) = 106n2 and b(n) = 10. Computer A performs 106 operations per second; computer B performs 1012 operations per second. In the worst case on an instance of size n, an implementation of an algorithm a solves a problem P in a(n) operations on computer A, and an implementation of an algorithm solves P in b(n) operations on computer B. (a) Which instances of P would you solve using the implementation of a on A, and which using the implementation of on B? (b) Estimate how long it would take in the worst case to solve an instance of P of size 30 using a on A and using B on B