(Duplicate Elimination with array) Use a one-dimensional array to solve the following problem. Read in 30 numbers, each of which is between 1 and 1000, inclusive. As each number is read, validate it and store it in the array only if it isn’t a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Provide for the “worst case” in which all 30 numbers are different. Use the smallest possible array to solve this problem.