Assume that we have a sorted list in an array: Index: 0 1 2 3 4 5 6 7 8 9 10 11 numbers: 12 15 17 19 22 26 28 30 32 34 36 38 we want to use the binary search algorithm to find the value 19 in the...

Assume that we have a sorted list in an array:

Index:         0       1       2         3       4        5      6      7      8       9        10        11

numbers:   12     15     17      19     22      26    28   30    32     34       36       38

we want to use the binary search algorithm to find the value 19 in the list. What would be the indexes of the array that the binary search would check to find the value 19

 the indexes and not the actual numbers in the list otherwise