Consider the following below graph. Assume we always choose the letter closest to the beginning of the alphabet first if there is ever a decision between multiple neighbor nodes in the BFS or DFS algorithms. [15 marks] i. ii. D A B E H F In what order will the nodes be visited using a Breadth First Search? In what order will the nodes be visited using a Depth First Search? Activate Windows