Answer Happy

Problem #3: (40 pts) (a) Either draw a graph with the following specified properties, or explain why no such graph exists: A simple graph with five vertices with degrees 2,3,3,3, and 5. (b) How many edges does a graph have if its degree sequence is 5, 2, 2, 2, 2, 1? Draw such a graph. (c) Consider the following graph. If there is ever a decision between multiple neighbor nodes in the BFS or DFS algorithms, assume we always choose the letter closest to the beginning of the alphabet first. (c.1) In what order will the nodes be visited using a Breadth First Search starting from vertex A and using a queue ADT? (c.2) In what order will the nodes be visited using a Depth First Search starting from vertex A and using a stack ADT? (d) Show the ordering of vertices produced by the topological sort algorithm given in class starting from vertex V1​ when it is run on the following DAG (represented by its adjacency list, in-degree form). Justify. Important Notes: - For problem #3, you don't need to submit any implementation in Java.