Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [2, 7, 11, 14, 15, 20, 23, 31, 32, 35, 39, 41, 47, 51, 59, 67, 71, 75, 79], how many comparisons with array elements are needed to find 71?