2. Now, suppose that an open hash table is used instead. The size of the table is still 13, and the same hash functions use. Lists are implemented as simple linked lists, using the following class to represent the list nodes: class ListNode int item; ListNode next; a) Draw the open hash table after the same sequence of insertions as in the previous problem b) The hash table is declared in Java as ListNode) table -nev ListNode [13), and of course initially all the values in the array anl Write a Java method that prints out all of the integers in the open hash table, using System.out.println c) Write a Java method for deleting a number N from the open hash table, if it is present. If N is not in the table, nothing should be done. (Use the hash function to find out where N should be!)