Please program in python or c++

18. Implement DFS and BFS graph traversal algorithms to traverse a given graph in the form of an adjacency matrix or an adjacency list. You can decide whether your graph will be directed or undirected. Take an input from users through command line, Print the time (as in counter we use in class like 0/0) when each vertex of the graph was discovered/processed. Support taking input up to 10 nodes/vertices. You can use any modern programming language for this assignment. (10 + 10 points) Submit: Source code and output 18. Implement DFS and BFS graph traversal algorithms to traverse a given graph in the form of an adjacency matrix or an adjacency list. You can decide whether your graph will be directed or undirected. Take an input from users through command line, Print the time (as in counter we use in class like 0/0) when each vertex of the graph was discovered/processed. Support taking input up to 10 nodes/vertices. You can use any modern programming language for this assignment. (10 + 10 points) Submit: Source code and output