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