Write an 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.

Enteranintegerbetween10and100:100 Thisisthefirsttime100hasbeenentered Enteranintegerbetween10and100:100 Enteranintegerbetween10and100:10 Thisisthefirsttime10hasbeenentered Enteranintegerbetween10and100:20 Thisisthefirsttime20hasbeenentered Enteranintegerbetween10and100:20 Thecompletesetofuniquevaluesenteredis: UniqueValue1:is100 UniqueValue2:is10 UniqueValue3:is20