What will be the result of attempting to compile and run the following program?
import java.util.*; public class Sets { public static void main(String[] args) { HashSet set1 = new HashSet(); addRange(set1, 1); ArrayList list1 = new ArrayList(); addRange(list1, 2); TreeSet set2 = new TreeSet(); addRange(set2, 3); LinkedList list2 = new LinkedList(); addRange(list2, 5); set1.removeAll(list1); list1.addAll(set2); list2.addAll(list1); set1.removeAll(list2); System.out.println(set1); } static void addRange(Collection col, int step) { for (int i = step*2; i<=25; i+=step) col.add(new Integer(i)); } } Select the one correct answer. a. The program will fail to compile since operations are performed on incompatible collection implementations. b. The program will fail to compile since the TreeSet denoted by set2 has not been given a Comparator to use when sorting its elements. c. The program will compile without error, but will throw an UnsupportedOperationException when run. d. The program will compile without error and will print all primes below 25 when run. e. The progra
