b)Using the following algorithm (binary search), it demonstrates its complexity by posing the recurrence equation.

int find (start, end) {

if (start> end)

return -1;

else half = (start + end) / 2;

if (x == array [half]) return half;

else

if (x

else

return (find (half + 1, end));

}

b)

The following recurrence equation represents the Mergesort algorithmT (n) = T (n / 2) + T (n / 2) + n Check its complexity.