Determine which statements below are true (multiple statements potentially true) about the DFS traversal of graph G starting from vertex A (no explanation needed): (a) When choosing among a group of neighbors which to visit next, if DFS uses the alphabetical order to break ties (e.g., starting from A, we prefer vertex B over E or F), then DFS visits E before it visits C. (b) Vertex A is not processed until all the other vertices in the graph have been processed. (c) (A general DFS question, not just the given graph) If DFS stumbles upon a vertex that is already discovered, this signifies the graph cant be a tree.