3.Set is a collection that contains no duplicate elements and the following interface defines operations normally supported by it. Set can be implemented by using an existing symbol-table implementation and ignore values. Implement all the unimplemented methods inside MyHashSet.

9. (10 Points) Set is a collection that contains no duplicate elements and the following interface defines operations normally supported by it. Set can be implemented by using an existing symbol-table implementation and ignore values. Implement all the unimplemented methods inside MyHashSet. public interface Set > void add(Key key) //add key into the set void delete(Key key); //remove key from the set boolean contains(Key key); //is key in the set? boolean isEmpty(); //is the set empty? int size() /umber of keys in the set