Assume you have a HashMap class that uses a threshold of $0\mathrm{.}75(75\%),$regardless of the collision resolution mechanism used, and has an initial array size of $13.$ You may assume the array is resized when the current item to be added will make the load factor greater than or equal to the threshold. Recall that the load factor is the fraction of a hash$\begin{array}{cc}\text{I}\text{t}\text{e}\text{m}& \text{H}\text{a}\text{s}\text{h}\text{c}\text{o}\text{d}\text{e}\\ \text{E}\text{l}\text{l}\text{i}\text{e}& 1324606073\\ \text{J}\text{o}\text{h}\text{n}& 278195619\\ \text{S}\text{a}\text{r}\text{a}\text{h}& 1460449349\\ \text{D}\text{a}\text{v}\text{i}\text{d}& 437601659\\ \text{K}\text{a}\text{r}\text{e}\text{n}& 1290184204\\ \text{R}\text{o}\text{n}\text{a}\text{l}\text{d}& 1306975744\\ \text{T}\text{o}\text{m}& 2125355666\\ \text{T}\text{i}\text{m}& 673057863\\ \text{M}\text{i}\text{k}\text{e}& 1334117090\\ \text{J}\text{o}\text{s}\text{h}& 1460128455\end{array}$

Table Continues On Next Page

$\begin{array}{cc}\text{C}\text{l}\text{a}\text{i}\text{r}\text{e}& 31303215\\ \text{M}\text{a}\text{r}\text{i}\text{n}& 764701412\end{array}$ map that is full. If the array is to be resized, assume the array doubles in size and adds one $(2*$ size $+1).$

Table $1$ contains a list of items and their associated hash codes that were computed with some

hypothetical hash function. Assume the items are added to a newly created instance of the HashMap class in the same order in which they are listed in the table. Based on this information, show what the array of the HashMap would look like after all the items have been added using both of the following

hash collision resolution techniques.

$1.$ Separate chaining

$2.$ linear probing

Provide $2$ arrays$($one for each problem$).$ One that uses separate chaining

and another that uses linear probing. Keep in mind as well that you do not need to compute the hash

codes as they are given to you. The hash codes in the following table are given as integer values.

Item Hash code

Ellie $1324606073$

John $278195619$

Sarah $1460449349$

David $437601659$

Karen $1290184204$

Ronald $1306975744$

Tom $2125355666$

Tim $673057863$

Mike $1334117090$

Josh $1460128455\begin{array}{cc}\text{I}\text{t}\text{e}\text{m}& \text{H}\text{a}\text{s}\text{h}\text{c}\text{o}\text{d}\text{e}\\ \text{E}\text{l}\text{l}\text{i}\text{e}& 1324606073\\ \text{J}\text{o}\text{h}\text{n}& 278195619\\ \text{S}\text{a}\text{r}\text{a}\text{h}& 1460449349\\ \text{D}\text{a}\text{v}\text{i}\text{d}& 437601659\\ \text{K}\text{a}\text{r}\text{e}\text{n}& 1290184204\\ \text{R}\text{o}\text{n}\text{a}\text{l}\text{d}& 1306975744\\ \text{T}\text{o}\text{m}& 2125355666\\ \text{T}\text{i}\text{m}& 673057863\\ \text{M}\text{i}\text{k}\text{e}& 1334117090\\ \text{J}\text{o}\text{s}\text{h}& 1460128455\end{array}$

Table Continues On Next Page

lashing Assignment

SC $385$

$\begin{array}{cc}\text{C}\text{l}\text{a}\text{i}\text{r}\text{e}& 31303215\\ \text{M}\text{a}\text{r}\text{i}\text{n}& 764701412\end{array}$