You can view all of the available building blocks in the:

What is the result of the following code?

``` 1 ArrayList mysteryArrayList = new ArrayList(); 2 String output = ""; 3 4 mysteryArrayList.add( "1" ); 5 mysteryArrayList.add( "2" ); 6 mysteryArrayList.add( "3" ); 7 mysteryArrayList.add( "4" ); 8 mysteryArrayList.add( "5" ); 9 mysteryArrayList.remove( 1 ); 10 mysteryArrayList.remove( 2 ); 11 12 Iterator mysteryIterator = mysteryArrayList.iterator(); 13 14 while ( mysteryIterator.hasNext() ) 15 { 16 String currentElement = ( String ) mysteryIterator.next(); 17 18 output += ( currentElement + " " ); 19 } 20 21 JOptionPane.showMessageDialog( null, output, "Mystery", 22 JOptionPane.INFORMATION_MESSAGE ); ```

Use a one-dimensional dynamic array to solve the following problem. Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is input, print it only if it is not a duplicate of a number already input. Provide for the “worst case,” in which all 20 numbers are different.

What will be an ideal response?