$(5.$d$).$ Discuss how the min$-$heap priority queue is obtained, arranged in order, and updated $($preventing a cycle from being created$)$ when each vertex is considered $($for each iteration$)$ if the priority queue is implemented as a min$-$heap for the Kruskal$$s algorithm to construct a minimum spanning tree for the graph G$.($Hint: Show one example of how the min$-$heap is constructed for a vertex$).$