Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [2, 7, 8, 14, 15, 17, 27, 29, 31, 35, 43, 50, 51, 53, 55, 56, 59, 63, 79], how many comparisons with array elements are needed to find 43?