Assume the following about the transaction data only for this checkpoint:

Each entry has three fields: id$,$ purchased$\_$item, cost

The id is guaranteed to be a string of lowercase alphabets.

The threshold is $2.$

The hash function hash$()$ returns the $($sum of the ASCII values of the alphabets at each

index in the id$)$ modulo $5.$ For example, hash$("$ab$")=(97+98)\%5=195\%5=0.$

Note that threshold counts chains longer or equal to threshold. The threshold

print format string has also changed to reflect this.

The current state of vour hashtable is shown in the below fiqure:

Question $1($a$)$ : Insertion

At which index in our hash table will the node: $\{$id: $"$bb$",$ purchased$\_$item:

"summer", cost: $30\mathrm{.}0$