Finding and printing nodes in a cycle or in a dead end based on DFS in an undirected graph

Question

I have an exercise for university where I have to write an extended DFS algorithm. Based on the DFS, I have to specify a procedure that traverses an undirected, continuous g