3. Consider the following directed graph. A F S B E C D (a) Find the order of the nodes after applying the BFS algorithm over the given graph. Assume that the source node is S and when visiting multiple nodes are possible, always visit the nodes in alphabetic order. Also, draw the predecessor sub-graph or the BFS Tree. (10 points) (b) Find the order of the nodes after applying the DFS algorithm over the given graph. Start the traversal from node S and when visiting multiple nodes are possible, always visit the nodes in alphabetic order. Also, draw the predecessor sub-graph or the DFS Tree. (10 points)