How do u do this

Consider a hash table storing integer keys that handles collision with linear probing: N = 42 h(k) = k mod 42 The sequence of keys inserted can be described as (21x p +84), where p is some integer. What can be said about the performance of such a setup, assuming not more than 42 keys are going to be put into the table? all the keys will be inserted into the table, but the performance will be very poor for both the insertions and the retrievals all the keys will be inserted into the table, the performance will be close to optimal for the insertions, but the retrieval of the items will be very slow all the keys will be inserted into the table, and the performance of both the insertions and the retrievals will be close to optimal some of the keys will not be able to be inserted into the table True or false: the structure below is a heap? 4 4 15 5 7 15 1 16 11 6 Select one: True False