Use the output from running the sample program $($GraphClient$.$py$)$ given in chapter $14$ for graphs to

perform the following:

$1.$ Draw the resulting undirected graph $2.$ and label each vertex.

$3.$ Draw the resulting depth$-$first traversal tree starting at vertex $0.$

$4.$ Draw the resulting breadth$-$first traversal tree starting at vertex $0.$

$5.$ Draw the minimum spanning tree $($MST$)$ starting at vertex $0.$

$6.$ Draw the resulting depth$-$first traversal tree starting at vertex $9.$

$7.$ Draw the resulting breadth$-$first traversal tree starting at vertex $9.$

Draw the minimum spanning tree $($MST$)$ starting at vertex $9.$

All the diagrams must match the output from the program.

For depth$-$first and breadth$-$first traversals

you should use same drawing technique from the textbook with dotted and solid arrows for edges

being visited.

Sample program files $($please see jpg attached$).$

Graph.py

GraphClient.py

Thank you.