Consider that we have the following list of integers in increasing order: 12345678 9 10 11 12 13 We want to find the index of the element x = 9 using the following binarySearch procedure. How many times is binarySearch procedure called? procedure binarySearch(i,j,x: integers, 1sisjsn) 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.4 O b.5 O c.3 O d. 2