Write a method (or more) in provided HashSet.java that is called .toString2() that... (Full question below)

HashSet.java

// Implements a set of objects using a hash table. // The hash table uses separate chaining to resolve collisions. public class HashSet { private static final double MAX_LOAD_FACTOR = 0.75; private HashEntry[] elementData; private int size; // Constructs an empty set. @SuppressWarnings("unchecked") public HashSet() { elementData = new HashEntry[10]; size = 0; } // ADD METHODS HERE for exercise solutions: // Adds the given element to this set, if it was not already // contained in the set. public void add(E value) { if (!contains(value)) { if (loadFactor() >= MAX_LOAD_FACTOR) { rehash(); } // insert new value at front of list int bucket = hashFunction(value); elementData[bucket] = new HashEntry(value, elementData[bucket]); size++; } } // Removes all elements from the set. public void clear() { for (int i = 0; i   18.1 Hashing 1077 [0 [1 [2 [3 [4] [51 6 [7 [8 [9] lementData size7 1 91 45 71 Figure 18.6 Hash collisions resolved by separate chaining