Two part question need help with it thanks.

P1)

P2)

Consider the following graph with vertices represented by squares and edges by lines connecting them. The edge weights are integers shown on each line. 2 2 List all of the edges in a Minimum Spanning Tree, MST, for this graph. Represent each edge by its vertices. For example, for the edge between vertices A and B, you would write AB. The order of the two vertices in an edge doesn't matter, so AB is equivalent to BA. Your answer is a list of edges delimited by commas. The order in which you list the edges does not matter as long as all of the edges in your list describe a MST