$(6$ pts$)$ Refer to the following graph..

a$)(3$ pts$)$ Using alphabetical ordering, draw a spanning tree $($starting from vertice $G)$

for this graph by using DFS$,$ depth$-$first search.

b$)(3$ pts$)$ Using alphabetical ordering, draw a spanning tree $($starting from vertice $G)$ for

this graph by using BFS$,$ breadth$-$first search.