I need solve this question

3. Analyze the following weighed graph, and find the shortest path between two vertices (each group will be assigned a different vertices by their teacher). 3. Analyze the following weighed graph, and find the shortest path between two vertices Vertices X and J F and Q. Shortest path = X-W-> AG-1->J Distance = 994 example solution (8 MARKS) 4. Use Kruskal's algorithm to construct the Minimum Spanning Tree (MST) for the example solution following graph. (8 MARKS) 4. Use Kruskal's algorithm to construct the Minimum Spanning Tree (MST) for a graph fuse a graph from the Appendix - Part 4.4 as assigned by your teacher. each group must get a different graph) (9,5) (9,8) (5,6) 16,9) (6,81 (6,0) (E'L)