5. You are given an array A of length n. Each value is 1. However, you do not know what the value of n is. You are allowed to access an element i of the array by calling A[i]. If i n, this will return a message saying that the location does not exist (you can think of this as an error message, but it will not crash your program). Describe an O(log n) algorithm to determine the value of n. 6. Suppose you have a multiset L of integers (a multiset is like a set, except it can contain multiple elements with the same value), where L = n. You want to determine whether the following is true: for all subsets K CL, the sum of elements in K is greater than or equal to |K|2. (Here, |K| denotes the number of elements in K.). Design an efficient (non-brute force) algo- rithm to verify whether the claim is true. What is the running time of this algorithm as a function of n<>