given the following key values, show what the data structures would look like after insertions:

Hashing Lab Given the following key values, show what the data structures would look like after insertions 27 53 13 10 138 109 49 174 26 24 (no preprocessing necessary: PL = key) a. Linear array of 10 elements using division hashing b. Bucket hashing of 10 elements (N=10) and the linear-quotient collision path algorithm ip = (p) % N N = 13, 4k+3 prime = 19 Array: Array: LQHashing: 1. ip = pk % N 2. q=pk/N if (q%N != 0) offset = q else offset = 4k+3 prime 3. While collisions: ip' = (ip + offset) % N 4. Set Array[ip]=key 3 0 0 N a UI A W e o N G UN A N