a) Consider a computer which can execute one million instructions per second irrespective of the type of instruction. Each column in the table below gives a number of instructions for some algorithm as a function of the input size n. Fill in the table with the running time required to execute each algorithm on inputs of size n = 10, 20, 50, 100. Give your answer in seconds, minutes, hours, days, or years as appropriate. (Keep in mind that the age of the universe is around 1.38 x 10 years!) n n log (n) n' 2" n! n = 10 n = 20 n = 50 n = 100