3. Binary search algorithm. Finding a target element x in an increasing ordered sequence of integers ALGORITHM 3 The Binary Search Algorithm. procedure binary search ( x : integer, a1,a2,,an : increasing integers) i:=1{i is left endpoint of search interval } j:=n{j is right endpoint of search interval } while iamtheni:=m+1elsej:=m if x=ai then location :=i else location :=0 return location \{location is the subscript i of the term ai equal to x, or 0 if x is not found Experiment: Please add a statement to print the variable i,j,m,a[i],a[m] for each iteration 4. Bubble sort algorithm. ALGORITHM 4 The Bubble Sort. procedure bubblesort (a1,,an : real numbers with n2) for i:=1 to n1 for j:=1 to ni if aj>aj+1 then interchange aj and aj+1 {a1,,an is in increasing order } Experiment: Please add a statement to print the variable i,j, and the array a for each iteration