Please create a Graph with the same C language program as the one shown below, and then use the created Graph to track and output the tracking path with DFS and BFS. The tracing sequence starts from node 0 and traces the entire Graph from the smallest number to the largest.

Output : DFS starting from vertex 0 : 0 1 2 3 BFS starting from vertex 0 : 0 1 2 3

1 2 3