***python***

Q1. Consider the list [20, 17, 3, 79, 74, 9, 64], sort the list in ascending order of magnitude and then perform a box trace of the method call: binary_search(list, 0, 6, 20).

Q2. In the hash table below of size 11 with the hash function h(key) = key % 11, if the linear probing technique is used to resolve the collisions, what does the hash table look like after the following insertions occur: 30, 94, 84, 73, 28, 26, 75 in the given order into an empty table? Include a brief explanation of the steps.

Q3. In the hash table below of size 11 with the hash function h(key) = key % 11, if the separate chaining technique is used to resolve the collisions, what does the hash table look like after the following insertions occur: 51, 42, 75, 41, 70, 66, 43, 76 in the given order into an empty table? Include a brief explanation of the steps.