Yes answer is right S2 is correct .
A ---> C ---> D --->E --->B now we will have no new node to visit again therefore backtrack from B and check unvisited node unvisited node from B is F therefore
A ---> C ---> D --->E --->B--->F is also one DFS path