Data Structure, HELP PLEASE & just give me the final answer

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