(a) Start at nodes and when there is a choice, follow edges from left to right. Number the nodes 1, 2, 3, ... in the order that they are found, starting with Node s = 1. (b) Darken the edges of the Tree specified by the predecessor array (c) What is the data structure used by BFS to store nodes that are found but not yet handled? (d) Circle the nodes that are in this data structure when Node 8 is first found. (e) What is the data structure used by DFS to store nodes that are found but not yet handled? (f) Circle the nodes that are in this data structure when Node 8 is first found. A) Breadth First Search (BFS) B) Depth First Search (DFS) S