3. In the Prim-Dijkstra-Jarnik algorithm for minimum spanning trees, different choices of starting vertex can cause the algorithm to find the minimum spanning tree edges in different orders, (163 students). Give an example of a graph with unique edge weights and two vertices p and q such that the edge order starting from p is the same as the edge order starting from