Please explain with detail.

2. (8 pts) Let G=(V.E) be a connected and undirected graph with n vertices, and the weight of all edges of G is w, and we have obtained a MST by using Kruskal's algorithm as described in the class. (a). What is the weight of this MST? Note the weight of a tree is defined as the sum of the weights of all edges that belong to the tree (4 pts). Answer: (b). Says now we have changed the weight of two edges of G to w/2 and we have used Kruskal's algorithm again. What is the new weight of the generated MST of G (4 pts)? Answer: 2. (8 pts) Let G=(V.E) be a connected and undirected graph with n vertices, and the weight of all edges of G is w, and we have obtained a MST by using Kruskal's algorithm as described in the class. (a). What is the weight of this MST? Note the weight of a tree is defined as the sum of the weights of all edges that belong to the tree (4 pts). Answer: (b). Says now we have changed the weight of two edges of G to w/2 and we have used Kruskal's algorithm again. What is the new weight of the generated MST of G (4 pts)