Implement an Open Addressing Hash Table (Linear Probing) Python... | Filo

2-5 Given an initially empty hash table HT with length 7, together with a hash function H(k) = k % 7. Let us use linear probing to solve collisions. What is theaverage search length for successful searches after inserting 22, 43, 15 one by one into HT?? ?. 1.5? ?. 1.6O C. 2O D. 32-6 Suppose that the size of a hash table is 11, and the hash function is H(key) = key % 11. The following 4 elements have been inserted into the table asAddr(14) = 3, Addr(38) = 5, Addr(61) = 6, Addr(86) = 9. When open