Applying the algorithm to the question and explaining the steps how the algorithm works on the question

Determine the number of comparisons needed to find each element in the array using a binary search. (explain in detail how to get the answer) For example, three comparisons are needed to find 9. - 31 - 27 - 14 - 17 - 48 - 7 Q2: Describe the differences between the linear search and the binary search algorithms: Step by Step Sorts : Show the steps taken by each sort on the following unordered list of integers Bubble sort Selection sort Insertion Sort