QUESTION 24 Match the term with its related description. A. Separate chaining Minimum number of edges required to span all vertices and that minimizes B. Open addressing the cost C. Trickle down Shortest path between two vertices in the graph D. Topological sort Search sequentially for vacant cells, incrementing the index until an empty cell is found. E. Dijkstra's Algorithm A technique in hash table that will search for an empty cell in the array using F. Minimum Spanning Tree some systematic way when collision occurs. G. Linear probing The process of comparison and swapping a node down a tree until it's below a larger node and above a smaller one. H. Trickle up 1. Quadratic probing Click Save and Submit to save and submit. Click Save All Answers to save all answers