Use a one-dimensional array to solve the following problem: Read in 10 numbers, each of which is between 10and 100. As each number is read, print it only if it's not a duplicate of a number that has already been read. Provide for the "worst case", in which all 10 numbers are different. Use the smallest possible array to solve this problem. This needs to be in Java. I really haven't gone through the code to see what's wrong, I am a little behind with other things.