1. Draw the contents of thetwo hash tables below after inserting the values shown. Show yourwork for partial credit. If an insertion fails, please indicatewhich values fail and attempt to insert any remaining values.The hash function used is H(k) = k mod tablesize.
a. Separate chaining, (where each bucket points to a linked listsorted from smallest to largest) Insert:4, 21, 6, 28, 14, 12
Expert Answer
An answer will be send to you shortly. . . . .