python questions

1.In the hash table below of size 11 with the hash function h(key) = key % 11, if the quadratic probing technique is used to resolve the collisions, what does the hash table look like after the following insertions occur: 62, 27, 92, 60, 10, 57, 28 in the given order into an empty table? Include a brief explanation of the steps.

2.In the hash table below of size 11 with the hash function h(key) = key % 11, if the double hashing technique, h2(key) = 7- key % 7 , is used to resolve the collisions, what does the hash table look like after the following insertions occur: 39, 12, 43, 98, 32, 40, 30 in the given order into an empty table? Include a brief explanation of the steps.