In this segment of an algorithm (Please show clear steps):

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 a big-O estimate for the number of additions in the best case. What input results in the best case time?

procedure foo(a₁, a₂, , a_n: integers)

i := 1

j := 2

while a_i < a_j and j n

i := i + 1

j := j + 1

location := j