chaining and probing are two methods used to resolve collisions in hash tables so that the amortized access time is O(1). For each of the following claims, indicate whether it is true of chaining, probing, both, or neither. (match each statement below to one of the 4 items)

1) Needs additional memory beyond the primary array for the hash table

2) Requires doubling the table periodically

3) May be either "linear" or "quadratic"

4) Crashes if the load factor becomes greater than 1

5) Requires computing th ehash function multiple times when doing an insertion