Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 5, 8, 14, 15, 23, 26, 27, 31, 35, 39, 43], how many comparisons with array elements are needed to find 39?