Problem $3$ Kruskal's algorithm $(15$ points$)$

One of the problems in transportation planning is to divide a metropolitan region into traffic analysis zones. Given a transportation network $G(N,A)$ with link costs $c$:$A|R|||,$ we want to partition the set of nodes into $k$ zones such that each zone $Z_i$subeN,AAi,$Z_i{Z}_j=,$AAi$j,$ and ${?}_i=1^k{Z}_i=N.$ Assume that $G(N,A)$ is undirected because $c_{ij}=c_{ji},AA(i,j)inA.$ Modify the Kruskal's algorithm to create $k$ zones. Provide the pseudocode for the problem. Use your algorithm to create $3$ zones in the following network: give me the code