Problem
(Implement a Set using open addressing with Quadratic probing) The implementation of a HashSet provided in the lecture resources implements the concept of a hash set using separate chaining for handling collisions. Fill in the code gaps in the file MyHashSetWithQuad.java to implement a concrete class for a hash set that uses open addressing with quadratic probing for resolving collisions. For simplicity, use f(key) = key % capacity as the hash function, where capacity is the hash-table size. Initially, the hashtable should have a capacity of 4. The table size is doubled whenever the load factor exceeds the threshold (0.50).