Problem
1. How can you correctly implement the test of Self Check 12?
2. Write a loop that prints all elements that are in both Set s and Set t.
3. Suppose you changed line 40 of the Spell Check program to use a Tree Set instead of a Hash Set. How would the output change?