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= 13 using the following binary Search procedure. How many times is binary Search procedure called? procedure binarySearch(l,),x: Integers, 15 1sjsn) m:= [(i+j)/2] If x = am then return m else if (x am and j >m) then return binarySearch(m+1.),x) else return o Select one: O a. 3 Ob.4 O c. 2. O d. 1