please explain in steps. thanks.

a) select the correct choices.

b)explain how the hash table will be filled.

O A hash function takes an item and makes it into a number. A hash code is the number computed by a hash function modulo the table size. A hash table is an array (or array of linked lists) that you put values into for storage. An item's location in this table is based on the hash code. The load on a table is the number of values in the table divided by the number of free slots in the table. Java's hash contract states that if two items are equal they will have the same hash code, and if two items are not equal they will have different hash codes. You can build sets out of maps and maps out of sets. b) Given the following hash function: h(x) = ceil(x.key), compute (1) the hash code for each key-value pair and (2) the location in a hash table where the element would go if the hash table was completely empty and had a fixed size of 7. Element shown as (key, value) pairs Hash Code (your answer) Hash Table Position (your Answer) (10.2, 44) (6.12, 10.4) (1.55, 10) (0.0, 1.4)