3. Give an asymptotic worst-case analysis of the following algorithm. If you get a recurrence, give that as your answer; you need not solve it. Procedure Sponge (A, i, j ) // A is an array, I and j are first and last indices // of the part of the array that we're dealing with. if j+l-i