Runtime analysis question in C programming

Please answer it with detailed explanation

Select all answers that are correct. O The running time for the worst case of the sequential search in n elements in O(n) The running time for the best case of the binary search in a binary search tree of n elements is O(1) The running time for finding the maximum value in a randomly ordered array with n elements is O(n) The running time for the average case of the sequential search in n elements is O(n) The running time for the best case of the sequential search in n elements is O(n) O The running time for finding the minimum value in an ordered array is 0(1) The running time for the worst case of the binary search in a binary search tree of n elements is O(log2n) The running time for the average case of the binary search in a binary search tree of n elements is O(n)