Suppose you have a hash table of size N = 256, and you are using double hashing. The keys in your hash are 4-digit integers (0000 through 9999) and your hash function is h(k) = (k²)%N The second hash function (used for probing) is h₂(k) = (sum-of-digits (k) * 8)%N What are the first 4 values in the search sequence (starting with the home position) for a record with key k-2025?

Excute the Program about Hash and show me the result . Source code import java.util.*; import java.io.*; class HashTable { public static void main(String[] args) throws IOException {  int key; try { BufferedReader in = new BufferedReader (new InputStreamReader(System.in));  System.out.print ("How many elements you want to enter to the hash table : "); int n = Integer.parseInt(in.readLine());  Hashtable hashTable = new Hashtable(); for(int i = 0; i < n; i++) {  System.out.print("Enter key for the hash table : ");  key = Integer.parseInt(in.readLine());  System.out.print("Enter value for the key : ");  hashTable.put(key, in.readLine()); }  Map map = new TreeMap(hashTable); System.out.println(map); } catch(NumberFormatException ne) { System.out.println(ne.getMessage() + " is not a legal value."); System.out.println("Please enter a numeric value."); System.exit(1); } } }//End

As far as I know, there is no difference between Array lists and Hash tables.

a. Hash the following reindeer names, in this order based on the first letter of their name into a hash table of size 8 donner blitzen cupid dancer vixen prancer comet dasher b. this list has an issue called what?