The given statements are:
Statement A: Binary search takes a sorted/ordered list and divides it in the middle.
Statement B: If the middle element is greater than the key, the search repeats only in the second half of the list.
Statement C: Hash-based searching calculates the position of the key in the list using a formula called the hash function and the key itself.
1
Statement A: true
Statement B: false
Statement C: false
2
Statement A: false
Statement B: false
Statement C: true
3
Statement A: true
Statement B: true
Statement C: false
4
Statement A: true
Statement B: false
Statement C: true