Problem 3. Suppose there is an array of length n. It contains values in the range of 1,...,n +1. However, exactly one value out of 1...., n +1} is missing from this array. Find this missing number as efficiently as possible in the following two cases: (a) The numbers in the array are stored in a random order. (b) The array is sorted such that the value stored at index1