2. (Duplicate Elimination) Use a one dimensional array to solve the following problem: Write an application that inputs five numbers, each between 10 and 100, inclusive. As each number is read, display it only if it's 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. run: Enter number: 10 10 Enter number: 15 10 15 Enter number: 17 10 15 17 Enter number: 14 10 15 17 14 Enter number: 25 10 15 17 14 25 BUILD SUCCESSFUL (total time: 34 seconds) run: Enter number: 10 10 Enter number: 10 10 has already been entered 10 Enter number: 15 10 15 Enter number: 15 15 has already been entered 10 15 Enter number: 17 10 1517 Enter number: 17 17 has already been entered 10 15 17 Enter number: 19 10 15 17 19 Enter number: 19 19 has already been entered 10 15 17 19 Enter number: 21 10 15 17 19 21 BUILD SUCCESSFUL (total time: 46 seconds)