PLS ASAP!!! I will good vote the answer

Consider that we have the following list of integers in increasing order: 12345 67 8 9 10 11 12 13 We want to find the index of the element x = 5 using the following binarySearch procedure. How many times is binarySearch procedure called? procedure binarySearch[i,j,x:integers, 1sis sn) m:= [[i+j)/2] if x = am then return m else if (x am and j>m) then return binarySearch(m+1,j,x) else return 0 Select one: O a.5 O b.3 O c. 2 O d.4