Problem $1$ :$$ Hash table data structure with your own program created similar to the ones$$ provided to answer all the questions

insert$($key$,$ value$),$ get$($key$),$ delete$($key$),$ contains$($key$),$ keys$()$ and values$()$

Implement a hash table data structure using Java should include the following operations:

insert$($key$,$ value$)$: Inserts a key$-$value pair into the hash table.

get$($key$)$: Retrieves the value associated with a given key. If the key is not found, return None.

delete$($key$)$: Deletes a key$-$value pair from the hash table based on the provided key.

contains$($key$)$: Checks if the hash table contains a specific key and returns True if found, False otherwise.

keys$()$: Returns a list of all keys in the hash table.

values$()$: Returns a list of all values in the hash table.

$$

You can choose to implement collision handling using techniques like chaining $($linked lists$)$ or open addressing $($linear probing, etc.$).$

And ensure that your hash table can handle resizing when it reaches a certain load factor.

Provide the code for your hash table implementation, including any helper functions or classes, and demonstrate how you would use it to perform the above operations. Test your implementation with various scenarios to ensure its correctness and efficiency.

$$

Please refer the following code snippet in Java below that implements a simple hash table:

$$

import java.util.HashMap;

public class HashTableExample $\{$

$$ public static void main$($String$[]$ args$)\{$

$//$ Create a hash table

$$ HashMap hashTable $=$ new HashMap$<>()$;

$//$ Insert key$-$value pairs into the hash table

$$ hashTable.put$("$apple$",5)$;

$$ hashTable.put$("$banana$",7)$;

$$ hashTable.put$("$orange$",3)$;

$$ hashTable.put$("$grape$",9)$;

$//$ Retrieve the value associated with a specific key

$$ int bananaQuantity $=$ hashTable.get$("$banana$")$;

$$ System.out.println$("$Quantity of bananas: $"+$ bananaQuantity$)$;

$//$ Check if a key exists in the hash table

$$ boolean containsPear $=$ hashTable.containsKey$("$pear$")$;

$$ System.out.println$("$Does the hash table contain 'pear'? $"+$ containsPear$)$;

$//$ Remove a key$-$value pair from the hash table

$$ hashTable.remove$("$orange$")$;

$//$ Print all keys and their corresponding values in the hash table

$$ for $($String key : hashTable.keySet$())\{$

$$ int value $=$ hashTable.get$($key$)$;

$$ System.out.println$("$Key: $"+$ key $+",$ Value: $"+$ value$)$;

$\}$

$\}$

$\}$

Collision handling using techniques like separate chaining using $($linked lists$)$ or open addressing $($linear probing, etc.$)$ as well resizing when it reaches a certain load factor $,$ also using separate chaining. Explain and justify each step methods of the code, and include a screenshot.