Question 3 1 pts A perfect hash function requires: O that every key value is prime O that the data structure use links O that every key value maps to a unique index O that the data structure has no empty slots Question 4 1 pts A collision occurs when Two links point to the same node O Two key values map to the same index O The left and right pointers are identical O Two indices contain the same value