Which of the following scenarios would make Binary Search inefficient?Searching in a large, sorted array.Searching in a small, unsorted array.Searching in a large, unsorted array.Searching in a large, sorted linked list.

Binary Search is inefficient in the following scenarios:

1. Searching in a small, unsorted array: Binary search is an algorithm that works on the principle of divide and conquer. It is most efficient when used on a large, sorted array. When used on a small, unsorted array, the time taken to sort the array first before applying binary search could make it inefficient.

2. Searching in a large, unsorted array: Binary search requires the array to be sorted. If the array is not sorted, we need to sort it first, which can be time-consuming, especially for large arrays. Therefore, binary search would be inefficient in this case.

3. Searching in a large, sorted linked list: Binary search requires random access to elements, which is not possible in a linked list as elements in a linked list have to be accessed sequentially. Therefore, binary search would be inefficient in this case.