Consider the following graph classes:$($a$)$ The class of graphs with at most one cycle.

$($b$)$ The class of pseudotrees, consisting of connected graphs with at most onecycle.

$($c$)$ The class of pseudoforests, consisting of graphs where each component has atmost one cycle.

For each of graph classes $($a$)($c$),$ answer the following questions:

$($i$)$ Is the class minor$-$closed?

$($ii$)$ If yes, what are the excluded minors? If no$,$ give an explicit example todemonstrate this.