申論題

44,30,95,33,50,82,18,55,70, 64,26

 Please create a hash table AA with 13 entries declared by

 int AA[13]；

 Let's insert the integers one by one and from the left to the right into the hash table. Assume the hash function is h(k) = k%13 and linear probing is used for collision resolution. Note that % yields the remainder when one integer is divided by another, for example, 20%13 = 7 and 5%13 = 5. Please answer the following questions: