Instruction: Show ALL workings for the question below.

Using the rotation method for hashing, first rotate the far-right two digits to the left and

then use digit extraction (first, third, and fifth digits), followed by modulo-division

method and then linear probe, store the keys shown below in an array with 19 elements.

How many collisions occurred? What is the density of the list after all keys have been

inserted?

224562 137456 214562

140145 214576 162145

144467 199645 234534

Enable GingerCannot connect to Ginger Check your internet connection or reload the browserDisable in this text fieldRephraseRephrase current sentence2Edit in Ginger