Given the first component of a hash function that converts alphabets to numbers as follows.

write every step nad also please write the code in c$++$

The second component is the modulo $\backslash (\backslash$boldsymbol$\{$m$\}\backslash )$ operation, where $\backslash (\backslash$boldsymbol$\{$m$\}\backslash )$ is the size of the hash table.

Draw the hash table if:

a$.$ The separate chaining is used, and the size $\backslash (\backslash$boldsymbol$\{$m$\}=5\backslash ),$

b$.$ The coalesced chaining is used, and the size $\backslash (\backslash$boldsymbol$\{$m$\}=20\backslash ).$

c$.$ Write the code for the search$()$ method in coalesced chaining.