b. Given the following graph:
0
3
2
1
4
5
8
6
7
In what order would a depth-first tree traversal, starting from node 0, visit these nodes?
(Suppose when there is a tie, the node will the smaller number will be visited first.)
In what order would a breadth-first tree traversal, starting from node 0, visit these nodes?
(Suppose when there is a tie, the node will the smaller number will be visited first.)
