I need help implementing this method for both, the dynamic and the static classes.

Useful methods

This is the method to complete.

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) @Override public Set difference(Set S2) { Set $3 = new StaticSet(DEFAULT_SET SIZE); for (Object obj : this) E e = (Emmobi; if (!$2.isMember(e)) S3.add(e); return S3; @Override public Set intersection (Set S2) { return this.difference(this.difference(S2)); @Override public boolean isMember(E obj) { for (int i = 0; i implements Set { // current number of elements in set private int currentSize; // array of elements private E elements[]; private static final int DEFAULT_SET_SIZE = 10; @SuppressWarnings("unchecked") public staticSet(int maxCapacity) { if (maxCapacity implements Iterator { private int currentPosition; in in public SetIterator() { this.currentPosition = 0; import java.util.Iterator; 5 public class Dynamicset implements Set { // static set private StaticSet theSet; 10 // current max capacity private int maxCapacity; 13 14 private static final int DEFAULT_SET_SIZE = 10; 150 16 public DynamicSet(int initialCapacity) { this.theSet = new StaticSet(initialCapacity); this.maxCapacity = initialCapacity; 17 18 190 @Override public Iterator iterator() { return theSet.iterator(); 21 A public static boolean checkDisjoint(Object[] sets) { return false