Using the following edges vector representing a graph, create a DFS algorithm function that returns a vector of visited nodes in order: vector> edges {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 3}, {3, 5}, {4, 5}, {4, 6}, {6, 5}};

Do NOT use ChatGPT to answer this question, or I will press dislike on your answer and report it for spam.