1. Match each term to its correct description. Write the letter of the description in the Matching Description column. Each term will have a description, BUT NOT all descriptions will be matched to a term. (1.2 points) Term Base Case Chaining Hash Function Linear Probing Quadratic Probing Recursive Case Matching Description Descriptions A. An open addressing collision resolution algorithm used in hashing. This algorithm adds 1 to the original hash function value until an open slot is found. B. A collision resolution algorithm used in hashing. This algorithm uses Python lists to store many key-value pairs in a single slot. C. An open addressing collision resolution algorithm used in hashing. This algorithm uses linked lists to store many key- value pairs in a single slot. D. An open addressing collision resolution algorithm used in hashing. This algorithm adds x (where x = 1, 2, 3, 4, ...) to the original hash function value until an open slot is found. E. A collision resolution algorithm used in hashing. This algorithm uses linked lists to store many key-value pairs in a single slot. F. One of the three laws of recursion, this law says a recursive function/method must include a selection statement which results in the function/method calling itself. G. One of the three laws of recursion, this law says a recursive function/method must include a selection statement which results in the function/method not calling itself. H. One of the three laws of recursion, this law says a recursive function/method must include a hash function used to determine where to store a key-value pair. I. A function which is used to determine where to store a key- value pair in a hash table.