1. briefly state the factors that influence the running time of an algorithm (that is implemented and run on some machine). (5) 2. briefly state the reasons for the use of asymptotic notation for specifying running time of algorithms. (5) 3. state the recursive definition (include the initial conditions) for each of the following sequences. (15) (a) (1, 2, 4, 8, 16, 32, 64,…) (b) (0, 2, 6, 12, 20, 30, 42, 56, …) (c) (4, 5, 7, 11, 19, 35, 67, 131, 259,…) 4. write the recursive definition for an = pn n! where a1 = p. (10) 5. questions from chapter 5.3 of your textbook (8th edition) (7+7+6+15+15) q1, q2, q3, q12, q25 6. state the recursive definition (include the initial conditions) for each of the following sequences. (15) (a) s= { x| x= 3k-2,  kz+} (b) s= { x| x= 5k+1,  kz+  {0}} (c) s= { x| x= 2k+1,  kz+}