do both and make sure correct answer

Dijkstra's shortest path algorithm is run on the graph, starting at vertex C. When a vertex is dequeued, 0 or more adjacent vertices distances are updated. For each iteration of the while loop in Dijkstra's algorithm, find the vertex dequeued and the adjacent vertices updated. Enter updated vertices as A, B, C or 'none' if no adjacent vertices are updated. Kruskal's minimum spanning tree algorithm is executed on the following graph. What is the first edge that will be added to the result? What is the second edge that will be added to the result? What is the first edge that will NOT be added to the result? What is the minimum spanning tree edge weight sum