一个散列表的散列函数是h(key)=key%19,共有20个槽,用的线性探查方法。从空表开始,依次进行如下插入删除操作,问这些操作的平均检索长度是:提示:散列表中不能插入两个相同的关键码There is a hash table of size 20, its hashing function is h (key) = key % 19. We use linear probing of closed hashing. We start from an empty table, in turns, perform the following insert operations and delete operations, ask you what is the average length of retrieval: (Express the answer by integer or fraction.)Hint: we can’t insert two same key values into a hash table.Add 26Add 25Add 24Add 195Del 26Add 176Add 45