Problem 1: Kruskal's Algorithm llustrate how Kruskal's algorithm works on an undirected graph G(V, E) with a weight function w : E R starting from vertex A:

please explain everystep and write the graph in paper please

Problem 1: Kruskal's Algorithm - Illustrate how Kruskal's algorithm works on an undirected graph G(V,E) with a weight function w:ER starting from vertex A : - Note: Edges are stored alphabetically in the adjacency list