QUESTION 2 Perform a depth-first traversal of the following graph, starting at vertex A Write a string listing the vertices in the order in which they were visited. For example, a possible (but false) answer would be AEFGBDC. Do not write spaces between letters. Break ties for where to visit next alphabetically QUESTION 3 Perform a breadth-first traversal of the following graph, starting at vertex A, using the alphabetical order of neighbors to break ties Write a string consisting of the 9 letters in the order in which they were visited. For example, a possible (but false) answer might be the string AIGCDFBHE. Do not leave spaces between letters in your string