Problem 2. Running the Algorithms (28 points) No explanation is required for any part of this problem Some parts of this problem require drawing graphs. The figures below were created using the ipe drawing editor, and I recommend this for your figures since it is free, easy to use, and makes nice figures. Otherwise, feel free to hand draw and scan your graphs (a) (8 points) Draw the DFS and BFS trees of the following two graphs, when called from vertex a. (So you should submit four trees in total.) There is ambiguity in the order which neighboring vertices are processed, so to make the trees consistent, process neigh bors in alphabetical order. In particular, for BFS neighbors are put in the queue in alphabetical order, and for DFS recursive calls to neighbors are made in alphabetical order (b) (5 points) Give a topological ordering of the vertices for each of the following two graphs You can either draw each graph on a horizontal line with vertices in topological order and all edges going from the left to right, or if it easier you can just simply list the vertices in topological order