1.0024 Given the sorted array: 12, 21, 29, 34, 35, 37, 42, 48, 50 show in detail the steps which will be used to find the numbers 12, 48, and 39 using a binary search.

To find the number 12:

The middle since (0 + 8)/ 2 = 4

Since 12 is less than the Middle number, it must be to the left of the list:

The middle since (0 + 3)/2 = 1

Since 12 is less than the middle number, it must be to the left of the list:

The middle since (0 + 0)/2 = 0

And the Number is found