3. Suppose you are given an array of Set instances. Write a non-member static method called checkDisjoint() which returns true if the intersection of the array is empty. The prototype for the method is: public static boolean checkDisjoint (Object() sets) 152 public static boolean checkDisjoint(Object[] sets) { 1530 154 155 156 157 return false; SOE 3 public interface Set extends Iterable 1 MOOOOOO public boolean add(E obj); public boolean isMember(E obj) public boolean remove(E obj); public boolean is Empty(); public int size(); public void clear(); public Set union(Set S2): public Set difference(Set 52); public Set intersection(Set S2): public boolean isSubSet(Set S2): public boolean equals(Set $2); public Set> singletonsets (: 16 import java.util.Iterator;0 public class StaticSet implements Set { // current number of elements in set, private int currentSize; w 100 // array of elements private E elements[]; private static final int DEFAULT_SET_SIZE = 10; WNEO00 public staticSet(int maxCapacity) { if (maxCapacity implements Iterator { private int current Position; public SetIterator() this.currentPosition = 0; 6 CO O