Help me!!! Thanks for helping me

3. Graphs. 1. Consider a simple graph on n vertices with no selfloops consisting of k disjoint cycles and no other edges. The cycles can he of possibly di'ereut lengths. A. single venex is not considered a cycle and recall that fora simple graph that there is no cycle consisting of two vertices. {a} Whatisthetotalnumberofedgeshithegraphintermsofpossihlynandk? U (b) What is the smallest number of connected components in the graph that can result if one removes E edges? (You may assume 2 is at most the masher of edges in the graph.) U (c) Assan 9