Hashing Lab 1. Given the following key values, show what the data structures would look like after insertions (no preprocessing necessary: Px-key) 15 54 13 10 135 114 49 174 27 24 a. Linear array of 10 elements using division hashing b. Bucket hashing of 10 elements (N-10) and the linear-quotient collision path algorithm N- 13, 4k+3 prime 19 Array: Array: LQHashing: 1.1p pk % N 2. qpkN if (q%N1-0) offset q else offset 4k+3 prime 3. While collisions: ip, (ip + offset) % N 10 4. Set Array [ipl-key 12 2. Fill in the table based on exercise1 Number of comparisons to retrieve this element Key Linear array Buckets - (Length of (# of elements Collision Path in linked list compared) 53 138 109 49 174 26