what are the four steps of the binary search algorithm?
['Step 1 - Read the search element from the user.', 'Step 2 - Find the middle element in the sorted list.', 'Step 3 - Compare the search element with the middle element in the sorted list.', 'Step 4 - If both are matched, then display "Given element is found!!!" and terminate the function.']