3. Suppose that you have six algorithms with (exact) running times shown below in number of instructions). You have a computer that can execute 450,000 MIPS. for each algorithm determine the maximum size of the input (n) such that the program finishes within the hour. 1.2 2. 3.n log(n) 4.27 5.100.15 4. Given the following list arrange it in ascending order of growth rate. 1.2.1 2. 10" 3. (2n) 4. na login) 5.log(n)