9. In this segment of an algorithm: a. What input results in the worst case time? b. Give a big-O estimate for the number of additions in the worst case. c. Give an estimate for the number of additions in the best case. What input results in the best case time? procedure foo(a1, a2, ..., an: integers) i:- 1 j:-2 while aj aj and j S n do i:= i + 1 j:= j + 1 od locationj 9. In this segment of an algorithm: a. What input results in the worst case time? b. Give a big-O estimate for the number of additions in the worst case. c. Give an estimate for the number of additions in the best case. What input results in the best case time? procedure foo(a1, a2, ..., an: integers) i:- 1 j:-2 while aj aj and j S n do i:= i + 1 j:= j + 1 od locationj