Choose the correct statement about linear search and binary search.Group of answer choicesThe best-case time complexity of linear search is O(n) and binary search is O(log n)The best-case time complexity of linear search is O(n) and binary search is O(1)The best-case time complexity of both linear search and binary search is O(1)The best-case time complexity of linear search is O(1) and binary search is O(log n)

The correct statement is: The best-case time complexity of linear search is O(1) and binary search is O(1).

Here's why:

1. Linear Search: In the best-case scenario, the element to be searched may be found at the first position. So, only one comparison is needed. Hence, the best-case time complexity of linear search is O(1).

2. Binary Search: In the best-case scenario, the element to be searched is the middle element of the sorted array. So, only one comparison is needed. Hence, the best-case time complexity of binary search is also O(1).