Tasks Forthis lab assignment. you will be providing an implementation of BFS and DFS of a graph with a maximum size of 10 nodes, numbered from 1 to 10. The input to the program will be the number of nodes and the adjacency list which are also the parameters to the two functions DFS and BFS. The output from your program will be the list 0t nodes visited in depth rst order and a list of nodes visited in breadth rst order. Hint #1: In both algorithms it is necessary to keep up with whether a node has been visited or not This can be clone with a onedimensional int or Boolean array that contains 10 slots