Searching - General Questions

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?

Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [2, 5, 8, 14, 15, 17, 20, 23, 29, 32, 35, 47], how many comparisons with array elements are needed to find 15?

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?

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?

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?