Explain

1. Give an example for a graph with exactly three connected components, 9 vertices and as many edges as possible (state the number of edges achieved). [3 marks] 2. Does there exist a dag (directed acyclic graph) with 6 vertices and 16 arcs? (a) If yes, draw the dag, and give a topological sorting of it. (b) If not, prove the non-existence