Given the following graph, try to find its minimum spanning tree.
What is the sixth vertex that Prim's algorithm includes if starting from vertex A (the numbering of the inclusion order starts from 1, not 0)?
