There is already an answer for this question on Chegg, please do not give me that answer. If that answer is given I will dislike the answer.

Implement both BFS (breadth first search) and DFS (depth first search) for an undirected graph G=, where V is the set of vertices in G and E be the set of edges in G. You have to use C++ programming language for implementation.

Input: G=, an undirected graph and any vertex (user-specified vertex) in the graph as a starting vertex (node).

Output: the sequence of vertices, the order in which the vertices are discovered by your program.

Expected to be done: (1) You have to make your programs compile without any syntax errors, (2) your programs should output correct answer for the given input graph G and (3) you need to run the program in the class and explain the output. (50+50=100 points)