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