Data Structure $($C$++)$:

You are given the formal representation of graph G$.$ Do the followings:

$1.$ Draw Undirected Weighted Graph.

$2.$ Draw the Adjacency Matrix and Adjacency List.

$3.$ Draw simulation for BFS and DFS$.$

$4.$ Draw simulation for Prim$$s algorithm and Kruskal$$s algorithm to find the MST$.$

G $=($V$,$ E$)$

V $=\{$A$,$ B$,$ C$,$ D$,$ E$,$ F$\}$

Value of E is given below:

E $=\{($A$,$ C$,19),($A$,$ F$,9),($B$,$ D$,5),($B$,$ E$,10),($B$,$ F$,5),($C$,$ D$,10),($C$,$ E$,13),($C$,$ F$,10),($E$,$ F$,5)\}$