Use a one-dimensional array to solve the following problem:
1. Write a java application that inputs five numbers from the user console (using System.in), each between 10 and 100, inclusive.
2. As each number is read, display it only if it’s not a duplicate of a number already read.
3. Provide for the “worst case,” in which all five numbers are different.
4. Use the smallest possible array to solve this problem.
5. Display the complete set of unique values input after the user enters each new value.
6. You can use the Try catch block if required to check any exceptions that your code can generate.