9. Provide the node traversal (the order in which nodes are explored) generated by a depth-first search of the given graph for the following scenarios. a. Starting at node 2, and attempting to reach node 7. Assume you always prefer a node with a smaller label value. b. Starting at node 8, and attempting to reach node 1. Assume you always prefer a node with a smaller label value. 10. Provide the node traversal (the order in which nodes are explored) generated by a breadth-first search of the given graph for the following scenarios. a. Starting at node 2, and attempting to reach node 7. Assume you always prefer a node with a smaller label value. b. Starting at node 8, and attempting to reach node 1. Assume you always prefer a node with a smaller label value. 11. Construct a Ks graph