An Array A contains n - 1 unique integers in the range]0, n - 1]. That is, there is one number in this range that is not in A. Describe in pseudo-code an O(n)-time algorithm for finding that number. You are only allowed to use O(log n) bits of additional space besides the array A it self