$(15$ points$)$ Show the result of inserting the following $($key$,$ value$)$ pairs to an initially empty hash table $($HashMap$)$ with $7$ bins when the collision resolution strategy is separate chaining:

$\backslash$table$[[$Key$,$Value$],[$apple$,3\mathrm{.}25],[$orange$,2\mathrm{.}50],[$kale$,5\mathrm{.}45],[$leek$,3\mathrm{.}25],[\backslash$table$[[$dragon$],[$fruit$]],8\mathrm{.}50],[$kiwi$,4\mathrm{.}25],[$banana$,1\mathrm{.}25]]$

Consider the following hash function from the textbook $($and this module's lecture$)$:

$h(s_0{s}_{1}dots{s}_{n-1})={\displaystyle \underset{i=0}{\overset{n-1}{}}}{s}_{n-1-i}{13}^i$

where $s_0{s}_{1}dots{s}_{n-1}$ are the ASCII codes of $n$ letters of the keys $($i$.$e$.$ if key$=$apple, then $s_0={?}^{\text{'}}{a}^{\text{'}}=97,s_1={?}^{\text{'}}{p}^{\text{'}}=112,$dots.