### Proof of N-Vertex Simple Graph

Prove or disprove: a. There exist a connected n-vertex simple graph with n+1 edges that contains exactly two cycles. b. There does not exist a connected n-vertex simple graph with n+2 edges that contains four edge-disjoint cycles.