What is the key difference between sequential search and binary search?

a$.$ Binary search is much more efficient than sequential search for large lists due to its logarithmic time complexity, but it requires the list to be sorted

b$.$ Binary search scans through each element sequentially, while sequential search divides the search interval in half.

c$.$ Sequential search works only on sorted arrays, while binary search works on unsorted arrays.

d$.$ Binary search has a time complexity of $0,$ while sequential search has a time complexity of $O(logn).$

Clear my choice