5. (15 pts) Starting at the page 24 (Analysis of Insertion Sort), the text describes a method of producing a formula for the growth rate of an algorithm and using that formula to calculate the bounds of the growth rate (best and worst case) for the that algorithm. This process was also discussed on the first day of the lectures. Use the same method to compute the running time T(n) of the following algorithm (Let length[A] = n.) by using a variable such as s, or to i.e., first provide a general running time T(n). Then show the running time T(n) for each of the best case and the worst case. Also express the number of times that each line is executed using n= length[A], in the table. FUNCTION1 (A) //A is an array of length n 1. n = length Al 2. count1 = 0 3. count2 = 0 4. for (i=1;i