Draw or describe a four-vertex graph, with distinct weights for its edges, with the following property: the ordering of the minimum spanning tree edges as they are added to the tree by Kruskal's algorithm is different from the ordering of the same edges by Jarnik's algorithm, no matter which starting vertex is chosen in Jarnik's algorithm. State which edges of your graph are part of the minimum spanning tree, which order they are added by Kruskal's algorithm, and which different orders are possible for Jarnik's algorithm. Your graph does not need to be complete.