lun completion Status: QUESTION 1 2 points Save What is the range of values computed by the hash function hash(x)-x % 100? 0 to 99 O o to 100 to 99 O 1 to 100 QUESTION 2 3 points When linear probing is used to manage collisions in a hash table, how are elements deleted so that a search operation is able to traverse over all elements that hash to a given index location? O A the element reference array[iJ.element is made null B. the HashEntry reference array[i] is made null C. thay are changed to zerco D. they are marked defunct E. none of the above QUESTION 3 2 points Save A Multiple entries with the same key are allowed in maps