1. 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 n
   2. n 3
   3. n log ( n )
   4. 2 2 n
   5. 100 n 1.5
2. Given the following list arrange it in ascending order of growth rate.
   1. n 2.1
   2. 10 n
   3. ( 2 n )
   4. n 2 log ( n )