No code needed. Binary search implementation with an explanation. Thanks

2. Consider the following list: [3,7,8,10,11.15. 20). Carry out the Binary Search algoirthm on the list, first when searching for the number 7. then when searching for the number 18. In both cases, show every step (i.e. the result of every recursive call to Binary Search). Note: Use the same convention we did in class - when finding the middle element of an even length list, choose the left position from the 2 possible middle positions