Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 7, 11, 17, 19, 20, 31, 35, 39, 41, 43, 44, 47, 50, 51, 53], how many comparisons with array elements are needed to find 43?