Krukal's algorithm and Prim's algorithm questions

Chegg will not accept my image for some reason here is the share link if you would look at it.

https://imgur.com/DBKSB3s

this is graph H

MST stands for minimum spanding tree and will be used as such in the question, thanks

a) If we run Kruskals algorithm on H, what is the first edge added to the minimum spanning tree (MST).

b) please list the first seven edges of the MST in order from first to seventh

c) If we run Prims algorithm on H starting from the vertex 9, what are the first eight edges added to the MST. list from first to eighth

d)

Note that H has 9 vertices and hence the minimum spanning tree of H will have 8 edges. The toal weight of the MST of H is [x].

Please write your answers in numbers only. What is the total weight of the MST?