JAVA
HASH SET
Create an implementation of Java’s Set<E> interface calledLinearProbingHashSet<E> that utilizes linear probing. Youimplementation should start with an initial array (I highlyrecommend that you use ArrayList instead of an actual array) ofsize 10 and should double the size whenever the array is more thanhalfway full.
You may not use Java’s built-in HashSet<E> class orHashMap<E> class. However, you are welcome to use other Javacollections.
In the interest of not making this assignment too difficult, youwill not be required to implement remove(Object),removeAll(Collection<?>), or retainAll(Collection<?>).You may, however, implement remove(Object) for extra credit if youchoose.
Hints
Use an ArrayList instead of an actual array inside your class tostore
PayPal Gateway not configured
PayPal Gateway not configured