Match the quantities on the left with values on the right. Multiple rows can have the same answer, and not every value in the dropdown may be matched. For each of the following three scenarios, the options are either $2$n$,$ n$-2,$ or n$.$ Again, it is possible two scenarios may have the solution, and not all three answers may be used.

$1.$Minimum number of strongly connected components of a directed acyclic graph with n vertices and $2$n edges.

$2.$Minimum number of edges in an undirected graph with two connected components.

$3.$Sum of the out$-$degrees of a directed graph with n edges.