Binary search on the sorted array T[1..5] = [3, 6, 9, 12, 15] looks for 12. With low = 1 and high = 5, the first mid is (low + high) DIV 2 = 3 and T[3] = 9. What is the correct next update?
- Ahigh becomes 2
- BThe search reports that 12 is absent
- Cmid is reset to 1 and the search restarts from the left end only
- Dlow becomes 4