Searching - General Questions

The worst-case time complexity of linear search is:

Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [2, 7, 11, 14, 15, 20, 23, 31, 32, 35, 39, 41, 47, 51, 59, 67, 71, 75, 79], how many comparisons with array elements are needed to find 71?

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 [3, 7, 11, 14, 15, 23, 27, 31, 35, 39], how many comparisons with array elements are needed to find 39?

Using binary search (mid = ⌊(low + high)/2⌋) on the sorted array [3, 7, 8, 11, 14, 17, 20, 26, 29, 31, 35, 38, 41, 43, 50, 53, 56, 59, 63], how many comparisons with array elements are needed to find 41?