/*******************************************************************************

* (Perform set operations on hash sets) Create two linked hash sets {"George", *

* "Jim", "John", "Blake", "Kevin", "Michael"} and {"George", "Katie", "Kevin", *

* "Michelle", "Ryan"} and find their union, difference, and intersection. *

* (You can clone the sets to preserve the original sets from being changed by *

* these set methods.) *

*******************************************************************************/

importjava.util.*;

publicclassExercise_21_01 {

publicstaticvoidmain(String[]args) {

Set<String>set1 =newLinkedHashSet<>(Arrays.asList(

"George","Jim","John","Blake","Kevin","Michael"));

Set<String>set2 =newLinkedHashSet<>(Arrays.asList(

"George","Katie","Kevin","Michelle","Ryan"));

Set<String>union =newLinkedHashSet<>(set1);

union.addAll(set2);

System.out.println("Union of the two sets: " +union);

Set<String>difference =newLinkedHashSet<>(set1);

difference.removeAll(set2);

System.out.println("Difference of the two sets: " +difference);

Set<String>intersection =newLinkedHashSet<>();

for (Stringe:set2) {

if (set1.contains(e))

intersection.add(e);

}

System.out.println("Intersection of the two sets: " +intersection);

}

}