Request solve attached question on graph theory

There are five cities in a network. The cost of constructing a road directly between i^th and j^th city is the (i, j)^th entry in the matrix. [0 3 5 11 9 3 0 3 9 8 5 3 0 infinity 10 11 9 infinity 0 7 9 8 10 7 0] An infinite entry indicates the impossibility of constructing a road due to geographical reasons. Draw a graph model of the system and use Kruskal's algorithm to determine the least cost of making all the cities reachable from each other