3. (10 points) In a directed graph, strongly connected component is defined as a subset of vertices C E V that are mutually reachable from each other, which means that for any pair of vertices v, w E C , there is a path from v to w, and from w to v. A) Let G be an undirected graph on n vertices, and let k be the number of components of G. If we add one edge to G, how many components might it have? B) Let G be a directed graph on n vertices, and let k be the number of strongly connected components (SCC's) of G. If we add one edge to G, how many SCC's might it have