5. (10 pts.) Binary Search Lower Bound. You are given an array A[1,...,n] that is sorted. You are then given an element x and you want to find its location in A, or report that it does not exist. The binary search algorithm runs in time O(logn). Show that any comparison-based algorithm must take 2(logn) time. By comparison-based, we mean that it can only access the elements of A by checking if they are above or below a given value. 5. (10 pts.) Binary Search Lower Bound. You are given an array A[1,...,n] that is sorted. You are then given an element x and you want to find its location in A, or report that it does not exist. The binary search algorithm runs in time O(logn). Show that any comparison-based algorithm must take 2(logn) time. By comparison-based, we mean that it can only access the elements of A by checking if they are above or below a given value