Write Java application that inputs five numbers, each between 10 and 100, inclusive. As each number is read, display it only if its 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 enters each new value. SAMPLE RUN : java DuplicateElimination

Enter an integer between 10 and 100:100 This is the first time 100 has been entered Enter an integer between 10 and 100:100 Enter an integer between 10 and 100:10 This is the first time 10 has been entered Enter an integer between 10 and 100:20 This is the first time 20 has been entered Enter an integer between 10 and 100:20 The complete set of unique values entered is: Unique Value 1: is 100 Unique Value 2: is 10 Unique Value 3: is 20