Part I (40 points).
Use a one-dimensional array to solve the following problem: Write an application called Unique.java that inputs five numbers, each between 10 and 100, inclusive. As each number is read from the console, display it only if it’s not a duplicate of a number already read. Use the smallest possible array to solve this problem. Display the complete set of unique values input after the user enters each new value. When the user has entered five different entries, the program terminates.
Below a simple run is shown of this application:
Enter number: 3
number must be between 10 and 100
Enter number: 15
15
Enter number: 20
15 20
Enter number: 30
15 20 30
Enter number: 20
20 has already been entered
15 20 30
Enter number: 40
15 20 30 40
Enter number: 20
20 has already been entered
15 20 30 40
Enter number: 200
number must be between 10 and 100
15 20 30 40
Enter number: 50
15 20 30 40 50
End