Making a call to procedure binarySearch as shown below, results in how many executions of the statement: mid:- floor(left + right) / 2) binarySearch(x: increasing integers) procedure integer, a1, ??, ??, , an left1 right: while left anid then else ifx-aleft locationleft y-25 binarySearch(y, 11, 21,27,41, 88) else location0 return location 0 5 25 01 O 2