Write ClubSets. Read the members of the chess club (n, then n names) and of the robotics club (m, then m names) into two TreeSet<String>. Without modifying the two original sets, print the union, the intersection, the members only in chess, the members in exactly one club, whether every robotics member plays chess, and whether the clubs share nobody.
For the input
4 Lina Omar Mei Ana
3 Mei Bo Lina
the program prints
Chess: [Ana, Lina, Mei, Omar]
Robotics: [Bo, Lina, Mei]
In at least one club (5): [Ana, Bo, Lina, Mei, Omar]
In both clubs: [Lina, Mei]
Only chess: [Ana, Omar]
In exactly one club: [Ana, Bo, Omar]
Every robotics member plays chess: false
No shared members: false