Project 10 (Graph traversal) Sections 1 and 2 Dfs Using adjacency matrix in C++ 1. Push the root node in the Stack. 2. Loop until stack is empty. 3. Peek the node of the stack. 4. If the node has unvisited child nodes, get the unvisited child node, mark it as traversed and push it on stack. 5. If the node does not have any unvisited child nodes, pop the node from the stack. Adjacency Matrix @ 0 1 2 3 4 01001 1 0 1 1 1 0 1 0 1 0 0 1 1 0 1 1 10 10