(Examples.) (4 points) Give one example of a directed graph on four vertices, A B. C, and D so that both depth-first search and breadth-first search discover the vertices in the same order when started at A. Give one example of an directed graph where BFS and DFS discover the vertices in a different order when started at A. Above, discover means the time that the algorithm first reaches the vertex. Assume that both DFS and BFS iterate over outgoing neighbors in alphabetical order. We are expecting: a drawing of your graphs and an ordered list of vertices discovered by BFS and DFS.]