Q4. Considering the graph shown below, using Dijkstra's algorithm, find the shortest- path spanning tree for going from S to all other vertices using the shortest paths indicating the corresponding paths and distances to reach each end point. 6 A B 1 3 1 S N 3 4 D E 6 N F a. [7 pts] You can fill out the Dijkstra Table below (you may add more rows, or may not use some.) Step Start N D(A), P(A) D(B), P(B) DC), P(C) D(D), P(D) D(E), P(E) D(F), p(F) b. [8 pts] Spanning Tree starting from S: Path: Distance: End Point: A B D E F