Program in C++ the depth first stack traversal for the pseudocode template given below, and produce identical output. Use node C as the root. Please provide running code. Thank you.

Image of Tree:

Pseudocode:

// A recursive solution for a stack traversal of a graph /* Each instance of traverse keeps track of one nodes adjacency list. The call to and return from traverse, substitute for push and pop. */ // the graph adjacency matrix static int[,] graph = { {0,1,1,0,0,0,0,0}, //A {1,0,1,0,0,0,0,0}, //B {1,1,0,1,0,1,0,0}, //C {0,0,1,0,1,0,0,0}, //D {0,0,0,1,0,1,0,0}, //E {0,0,1,0,1,0,1,1}, //F {0,0,0,0,0,1,0,0}, //G {0,0,0,0,0,1,0,0}, //H //A B C D E F G H }; // where I've been static bool[] visited = {false, false, false, false, false, false, false, false}; // the resulting tree. Each node's parent is stored static int[] tree = {-1, -1, -1, -1, -1, -1, -1, -1}; static void Main() { // "Push" C traverse(2); printtree(); } void traverse(node) { mark node as visited print(node) init target to 0(A) while(not at end of nodes list) { if(target is a neighbor and target is unvisited) { whos targets daddy? traverse(target) // push } next target } return // pop } /* Los Outputs: The stack traversal path: C A B D E F G H The resulting tree: Node Parent A C B A C @ D C E D F E G F H F */