Consider an algorithm A with running time n √ n. Assume that A can solve instances of size n on a machine that takes 10−12 seconds per operation. What size instances (in terms of n) can A solve in the same time on a machine that takes 10−15 seconds per operation?