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