Problem Five: (10 points, 5 points each) Assume that we use %20 to hold the following data set (by the order that is inserted to the table): 122, 74, 134, 78, 75, 128, 349, 119, 223, 135, 295, 397, 82, 214.

1. Draw the hash table if we use chain to handle collision
2. Draw the hash table if we use linear probing to handle collision

Problem Six: (10 points, 5 points each) Using same data set of Problem Five. Using mid-square hash, number of bucket is 100, key is 243, and R = 2

1. Draw the hash table if we use chain to handle collision
2. Draw the hash table if we use linear probing to handle collision