Consider a open bucket hash table and closed bucket hash table in which the keys are student identifiers (strings of 6 digits). Assume the following number of buckets and hash function: m = 100;...

1. Consider a open bucket hash table and closed bucket hash table in which the keys are student identifiers (strings of 6 digits). Assume the following number of buckets and hash function:

m = 100; hash(id) = first two digits of id

#. Starting with an empty hash table, show the effect of successively adding the following student identifiers: 000014, 990021, 990019, 970036, 000015, 970012, 970023.

Use following function as second hash function

hash(id) = last digit of id

# Show the effect of deleting 000014 from the hash table.

(Java Programming DSA)