(Java) C-4.45 page 185 (40 points): DO NOT SORT THE ARRAY. Must provide a test application with at least 2 sets of numbers. Hint: find smallest, largest, and sum. Compare the sum with the series summation.

C-4.45 An array A contains n-1 unique integers in the range (0,n 1], that is, there is one number from this range that is not in A. Design an O(n)-time algorithm for finding that number. You are only allowed to use 0(1) additional space besides the array A itself