Search(A, x): Use binary search. Time is O(log n)
Find-Minimum(A): Can be performed in O(1) time, as the first or last element is minimum depending on whether the array is sorted in ascending or descending order respectively.
Delete(A, x): Search x + move other elements after x = O(log n) + O(n) = O(n)
Hence (B) is correct.