b. Perform a depth-first search on the directed graph below. (i) number the nodes

In this problem, you will apply different traversal methods on a given directed graph. The start node is denoted by S. When arbitrary decisions on order must be made assume that child nodes are visited from left to right. a. . Perform a breadth-first search on the directed graph below (on the leftNumber the nodes according to the order in which they are visited (become gray). For example, the first node visited is S so S is numbered 1. Then, the left child of S is visited so it is numbered 2. Show the order numbers inside the circles. (ii) Show the distance of each node to S beside each circle. (iii) Show the breadth-first tree