try out this applet by creating some small graphs and finding their minimum spanning trees (for some configurations you'll need to be careful positioning the vertices so that the weight numbers don' fall on top of each other as you step through the algorithmyou'll see that vertices acquire red borders and edges are made thicker when they're added to the minimum spanning tree vertices that are in the tree are also listed below the graphon the left on the rightthe contents of priority queue (pqare shown the items in the priority queue are edges for instancethe entry ab in the queue is the edge from to bwhich has weight of we'll explain what the priority queue does after we've shown an example of the algorithm use the graphw workshop applet to construct the graph of figure the result should resemble figure figure the graphw workshop applet now find this graph' minimum spanning tree by stepping through the algorithm with the tree button the result should be the minimum spanning tree shown in figure the applet should discover that the minimum spanning tree consists of the edges adabbeecand cffor total edge weight of the order in which the edges are specified is unimportant if you start at different vertexyou will create tree with the same edgesbut in different order