2) [1] The running time of the algorithm is the sum of running times for each statement executed; a statement that takes C steps to execute and executes n times will contribute C; * n to the total running time. Compute T (n), the running time of the following algorithm on an input of n values. State an asymptotic upper bound using O-notation. Linear Search(A, key) lit1 2 while i <>