(c) Consider the following graph. If there is ever a decision between multiple neighbor nodes in the BFS (Breadth First Search) or DFS (Depth First Search) algorithms, assume we always choose the letter closest to the beginning of the alphabet first. (c.1) In what order will the nodes be visited using a Breadth First Search? (c.2) In what order will the nodes be visited using a Depth First Search? (d) Show the ordering of vertices produced by the topological sort algorithm given in class when it is run on the following DAG