Q$4$ Hash Table Insertion

$4$ Points

Grading comment:

Consider the following code snippet.

Map map $=$ new HashMap$<>()$;

map.put$(20,$ "green"$)$;

map.put$(2,$ "red"$)$;

map.put$(10,$ "blue"$)$;

map.put$(4,$ "green"$)$;

map.put$(105,$ "green"$)$;

map.put$(102,$ "yellow"$)$;

map.put$(38,$ "purple"$)$;

Question $4\mathrm{.}1$

Q$4\mathrm{.}12$ Points

Grading comment:

Assuming the HashMap does not resize and its underlying array is fixed at $5$ buckets, which of the following diagrams might represent the state of the hash table at the end of the code snippet?

For this question, assume that the hashCode simply returns the HashMap.key's int value to then be reduced by modulo by the table size of $5$ with no resizing $($i$.$e$.$ our hashCode operation is HashMap.key $\%5).$