(1 point) This exercise refers to the binary search algorithm given below. procedure binary search (x : integer, ai,a2,..., an: increasing integers) i 1 Nbrace i is left endpoint of search interval brace j n Vbrace j is right endpoint of search interval Vrbrace while i am then i := m + 1 else j := m end if x = a, then location : else location := 0 Nbrace location is the subscript of term equal to x, or 0 if x is not found rbrace Suppose our list of increasing integers is shown in the table below 1345810 1314 Suppose we conduct the binary search algorithm on this list where we search for 13. (a) In the language of the algorithm above, enter the correct values for the following variables for this particular search: x- n= (b) After the first iteration of the while loop, what are the values of the following variables