HASHING The Linear Hash organization below currently has 8 records…

Question Answered step-by-step HASHING The Linear Hash organization below currently has 8 records… HASHINGThe Linear Hash organization below currently has 8 records and 6 buckets. The split pointer (p) points to bucket 2. For simplicity we only show key values of records:p0 1 2 3 4 5Consider the following:- Hash functions: hL (key) = key mod (N * 2L), where N = 2 and L = 0, 1, 2, 3, 4 …- Currently L is 1- The split policy is to split every 2 insertsa. Briefly explain how the current state of the buckets would have been achieved from an initially empty hash table.b. Insert these keys (records) in this sequence: 24, 15, 17, 10, 3, 28, 8. Show your work at the intermediate steps i.e., at each split.Reference: Elmasri and Navathe, Fundamental of Database Systems, 7th Edition, Image transcription text1. (20) The Linear Hash organization below currently has 8 records and 6 buckets. The split pointer (p) pointsto bucket 2. For simplicity we only show key values of records: P 0 1 2 3 4 5 16 22 7 13 30 27 5 Consider thefollowing: – Hash functions: hi (key) = key mod (N * 2!), where N=2 and _ =0, 1, 2, 3, 4 … – Currently … Show more… Show more  Computer Science Engineering & Technology MYSQL COMPUTER S CSC384 Share QuestionEmailCopy link Comments (0)