Question 9. (5 points) Let G be an n-vertex (where n > 1) directed graph that has the following properties: 1. For every vertex v, the number of other vertices that appear on the adjacency list of is exactly the same as the number of times that v appears in the adjacency lists of other vertices (in other words, for every vertex v the number of directed edges that have v as head is equal to the number of directed edges that have v as tail) 2. The undirected version of G (the undirected graph obtained from G by ignoring edge directions) is connected. Choose the best of the following statements about G: 1. G must be strongly connected 2. G does not have to be strongly connected 3. G does not have to be strongly connected, but it is always possible to make it strongly 4. G does not have to be strongly connected, but it is always possible to make it strongly 5. G could have more than one strongly connected component, but for every pair of its connected by adding to it no more than two new edges connected by adding to it no more than one new edge strongly connected components there has to be at least one edge between them