Consider the following set of points (1,1), (1,3), (1,8), (1,9), (5,5), (4,4), use dmin that was described in the class to cluster them into two classes.

Find the union, intersection, and difference (? − ?) of the following pairs of sets.(a) ? = The set of positive odd integers less than 15.? = The set of positive even integers less than 16.(b) ? = {?, ?, ?, ?, ?, ?}? = {?, ?, ?, ?, ?}

How many elements are there in the set {{5, 9}, {1, 2, 3}, {3, 4, 5, 6, ...}, 1, 0}? infinitely many

Consider the equals() method from the java.util.AbstractList class.  (a) Draw a control flow graph for this method. Several possiblevalues can be used for the node number in the graph. Choosesomething reasonable.(b) Label edges and nodes in the graph with the corresponding codefragments. You may abbreviate predicates as follows whenlabeling your graph:A: o == thisB: !(o instanceof List)C: e1.hasNext() && e2.hasNext()C: e1.hasNext() && e2.hasNext()D: !(o1 == null ? o2 == null :o1.equals(o2))E: !(e1.hasNext() $\parallel$ e2.hasNext())(c) Node coverage requires (at least) four tests on this graph.Explain why.