a) O(n)
b) O(log n)
c) O(n^2)
d) O(1)
For Explanation Click Here:
Binary search works by repeatedly dividing the search interval in half. If the value of the search key is less than the value in the middle of the interval, the search continues in the lower half, or if greater, it continues in the upper half. This halving process results in a time complexity of O(log n).