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