Consider that we have the following list of integers in increasing order: 123456789 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 binary Search(l.),x: Integers, 1sissn) m: [(1 +])/2] if x=am then returnm else if (x am and j>m) then return binarySearch(m+1.j,x) else return o Select one: O a 2 O b.3 O c. 1 O d.4