When performing the graph traversal to build the trees, the cost of the edges is irrelevant, follow the alphabetical order convention discussed in the video lectures.a$)[1$ pts for each traversal$]$ Based on the undirected graph shown below, on a piece of paper, draw the BFS tree and DFS tree that will result when calling BFS and DFS starting at node A$.$ In the textbox below, list the order in which the nodes are visited in a BFS and DFS traversal according to the tree traversals. Note: You don't have to submit the drawing for credit.b$)[3$ pts Complete the sequence of edges in the MST in the order that Prim's algorithm includes them when building the tree starting at node H$.$ For example HC$,$ HF$,$ etc.c$)[1$ pt$]$ What if the cost of the Minimum Spanning Tree for such graph?