Based on the following adjacency matrix representation of a graph (where there are no weights assigned to the edges), in which order are the elements of this graph accessed during a BFS and DFS traversal starting at node A? Remember to enter your answers separating nodes by commas, no spaces (i.e. A,B,C,D) When doing the traversal, follow the nodes in alphabetical order (as discussed in class). That will be the only correct answer F 1 BSF starting at A: DSF starting at A: Draw the BFS and DFS trees (vertices and tree edges) of the traversals from the previous question. Take a picture of your answer and attach it to this question. Make sure your image is legible, otherwise, your answer might not get credit