USING C LANGUAGE (C PROGRAMMING) SOLVE THIS TASK

PLEASE PROVIDE SCREENSHOT OF INPUT AND OUTPUT

Tasks: Backtracking can be defined as a general algorithmic technique that considers searching every possible combination to solve a computational problem. Depth-First-Search (DFS) in a graph uses Backtracking technique by means of recursive function. 0 3 2 1 4 Given the following DFS graph traversal function in C programming, modify the function to print the visited vertices AND backtracking vertices for the above graph. Screen shot your main() function, the DFS algorithm, and the output of your program. Paste it in Microsoft Word and submit via MST