COMPSCI 120 Assignment DFS & BFS This assignment familiarizes you with graph traversals. To this end, consider the graph depicted below. 1. Perform a depth-first traversal, as discussed in the lectures, of the given graph starting from node 0. When you have a choice of two neighbouring nodes to pick, please pick the node with the lowest numeric label. Write down each step of the traversal. A step is when a node turns grey or black. 2. Show the content of the stack at each step. An example step might be: "step 3: node 4 turns grey. Stack content: 4, 2, 0" or "step 3: node 4 turns black. Stack content: 2, 0". When writing the stack content write contents in the top to bottom order. 3. Perform a breadth-first traversal, as discussed in the lectures, of the graph starting from node 0. When you have a choice of two neighbouring nodes to pick, please pick the node with the lowest numeric label. Write down each step of the traversal. A step is when a node turns grey or black. 4. Show the content of the queue at each step. An example step might be: "step 3: node 4 turns grey. Queue content: 4, 2,0" or "step 3: node 4 turns black. Queue content: 2,0". When writing the queue content write contents in the first to last order. Due 28th of February 2020