discret math

Q#2: List all the steps used to search for numbers 16 in the following list (3, 8, 12, 34, 61, 84, 91, 110). 131 a. a binary search. The number of elements in the list is n= and x= L R Loop condition LCR PRI X>a. After the loop: The condition (x is satisfied so the location == b. Compare and contrast the linear Search and binary Search algorithms in searching for the number 16 in the above list