Use a one-dimensional array to solve the following problem: Write an application that inputs five numbers, each of which is between 10 and 100, inclusive. As each number is read, display it only if it is not a duplicate of a number already read. Provide for the worst case, in which all five numbers are different. Use the smallest possible array to solve this problem. Display the complete set of unique values input after the user inputs each new value. The program should be called Unique, and it will call a class named UniqueTest. The code for UniqueTest.java is provided below, along with a template for Unique.java. The code for UniqueTest.java needs no modification. You can run it as is. The code for Unique.java needs to be completed. The comments in red tell you where you need to add code. Please remember to comment your code, because comments are evaluated as part of your grade.

The code for UniqueTest.java is:

The partial code for Unique.java is:

II Unique Test.java Il Test application for class Unique public class Unique Test public static void main( String argsI) Unique application new Unique); application.getNumbers(); ) ll end main h /l end class Unique Test