3. (30 POINTS) Given the algorithm below, analyze its running time by writing its recurrence relation first, then by providing the asymptotic growth function that corresponds to the recurrence relation. procedure doSomething (A, m, start, end) { if start > end return null mid=(start + end)/2 if m==A[mid] return mid else if m>A[mid] return doSomething (A, m, mid+1, end) else return doSomething (A, m, start, mid-1) }