Which of the following best describes the time complexity of binary search compared to sequential search?

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

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

c$.$ Both binary search and sequential search have a time complexity of $O(n).$

d$.$ Both binary search and sequential search have a time complexity of $O(logn).$

Clear my choice