pts$]$ Minimum Spanning Tree. ANSWER ASAP PLZZ

$($a$)5pts$ For the following graph, find the minimum spanning tree that will be generated by Kruskal algorithm. Complete the sequence of edges in the MST in the order that Kruskal's algorithm includes then by specifying their edges. Note: the edge between vertex $1$ and vertex $2$ is denoted by $($vertex $1,$vertex $2).$ Fo example, the edge between vertex A and $C$ is denoted by $(A,C).$

The sequence of edges in the MST by Kruskal's algorithm:

$(C,F{)}_{E,G}{?}_{?}$

$($b$)[5$ pts $]$ For the following graph, find the minimum spanning tree that will be generated by Prim's algorithm. Assume stating from vertex A$.$ Complete the sequence of edges in the MST in the order that Prim's algorithm includes them by specifying their edges. Note: the edge between vertex $1$ and vertex $2$ is denoted by $($vertex l$,$ vertex$2).$ For example, the edge between vertex A and $B$ is denoted by $(A,B).$

The sequence of edges in the MST by Prim's algorithm:

$(A,E)(E,B)$