Pseudocode is given below for the recursive part of the cycl…
Pseudocode is given below for the recursive part of the cycle-checking algorithm discussed in class; assume the y loop is completed before the z loop begins. In the graph pictured below, the labels are vertex indices; observe that the graph has 11 vertices. At what value of the current vertex x will the algorithm first detect a cycle? Justify your answer by showing all work and stating any assumptions you made. private bool DFS_Cycle_Recursive(int x, int = order Increment order If there exists a neighbor y of x such that y was visited earlier, but not the previous vertex visited, then return true If there exists an unvisited neighbor z of x, then call DFS_Recursive_Cycle(z, v, order), and return true if this call returned true Return false }