Consider the graph shown below: 1 2 3 4 5 6 a. What is the degree of each node? (2 points) b. Show how Breadth-First Search works on the graph starting at node 3 (i.e., show the order of nodes visited). (4 points) Show how Depth-First Search works on the graph starting at node 3 (i.e., show the order of nodes visited). (4 points) C