Problem $1.$ Given the graph $G(V,E),$ show the BFS and DFS traversals of the graph starting from node $s.$

Your answer must:

Provide every step taken to get to the final state including visited$[$i$]$ array and their respective data

structure states for both traversals.

Provide two separate drawings of final spanning trees from both the traversals.