Let G be a directed, unweighted graph with exactly k strongly connected components. If a single

directed edge is added to G $($where there was not already an edge$),$ which of the following is possible?

There may be more than one possibility.

$1.$ The number of strongly connected components increases

$2.$ The number of strongly connected components decreases

$3.$ The number of strongly connected components stays the same

Justify your answer