a) Please show how to use a stack to do a DFS and draw the final DFS tree. b) Please show how to use a queue to do a BFS

[answerhappygod]

a) Please show how to use a stack to do a DFS and draw the final DFS tree.
b) Please show how to use a queue to do a BFS and draw the final BFS tree.
c) Now assume the weights of edges (A, E), (E, F), (B, F), and (C, F) are 3, weight of edge (C, B) is 2, and weights of edges (A, C), (C, D), and (D, F) are 1. Please use Prim’s minimum spanning tree (MST) algorithms to show how to find such a MST tree.
Question 4: BFS, DFS, and MST (20 pts). For below graph, starting from node D a) Please show how to use a stack to do a DFS and draw the final DFS tree.