help!!! please thx!!

CSCI 2315 Data structures Quiz3 Graphs/Paths/Trees This is a closed book qui. This examination io designed to evaluate your basie understanding of Graphe/Pathe/Trees and their related data struetures. Thio iua 100 point quiz points are noted with each question. All anavers must be recorded on thie quia to receive credit and partial credit is available. Time allowed 30 minutes Question 1 (20 points): Starting at Node/Vertex A, please construct the Minimal Spanning Tree using Prim's Algorithm. -Please list the nodes in the order they are added with the edge-cost -Please provide the total cost -Please circle each edge of the MST 17 19 15 19 27 18 31 19 15 31 Question 2 (20 points): Breadth Pirst Search. Starting at Node/Vertex A show the path to node/vertex G using the Breadth First Search. - Please show the data structure you used to determine this path Please calculate the total cost of the path. 17 19 15 19 27 18 31 19 15 31 27 Page 1 of 4