value pair and (2) the location in a ti. 3. Which of the following is true for a hash table with separate chaining? Circle all that apply. a. There is an upper bound to the number of elements that we can insert into the hash table because of space constraints in the array. b. There is no upper bound to the number of elements that we can insert but inserting too mamy: elcments can affect the nun time of insert c. There is no upper bound to the number of elements that we can insert but inserting too marsy elements can affect the nun time of find d. There is no upper bound to the aumber of clements that we can insert and no perfocinance impact for any operations since we ean alinays append or prepend to the list value pair and (2) the location in a ti. 3. Which of the following is true for a hash table with separate chaining? Circle all that apply. a. There is an upper bound to the number of elements that we can insert into the hash table because of space constraints in the array. b. There is no upper bound to the number of elements that we can insert but inserting too mamy: elcments can affect the nun time of insert c. There is no upper bound to the number of elements that we can insert but inserting too marsy elements can affect the nun time of find d. There is no upper bound to the aumber of clements that we can insert and no perfocinance impact for any operations since we ean alinays append or prepend to the list