3. Show how the binary search algorithm searches for 25 in the sorted list below: XXXXXXXXXX XXXXXXXXXX let i = be the first number j = be the last number m = be the middle number I need to see how...

3.  Show how the binary search algorithm searches for 25 in the sorted list
below: 4 6 17 25 32 39 41 43 45 49

let i = be the first number

j = be the last number

m = be the middle number

I need to see how this is done and how the numbers narrow down to 25. Please break this down in described steps. I'm really confused.