Hi, I need some help with the question below:

Thank you.

Start from vertex e, find a minimum spanning tree of the following graph using Prim's algorithm: 8 13 8 10 ta d 5 17 20 Show the minimum weight and the sequence of edges added