How do I implement the following question using Java? For question Q2 - 3, the supplementary array for sorting should be a linked list. Please see screenshot.

Q1) Implement Hash Table algorithm with an array. . The array size is 33 -The hash function is hash(i) abs(i) % length Resolve collisions by implementing linear probing Include methods add, remove and contains . Your code should provide rehash method if the hash table is full up to 75% Q2) Suppose you are given the following array of integers 1. After inserting the numbers into a tree, construct a valid min 2. Implement heap sort algorithm by repeatedly calling remove 3. You can use a supplementary array for sorting 6, 50, 11, 25, 42, 20, 104, 76, 19, 55, 88, 2 heap tree for this sequence the root method by using arrays 4. Print the intermediate array after step 1 and also the intermediate arrays after each iteration in step 2