MATH/CSCI Graph Theory Help:) Thank you for helping me I appreciate it, will definitely upvote the correct solution! Please read the question carefully and answer it fully! If you handwrite the solution, please be as legible as possible:) take care and have.a great day!!

2. Uniicyclic Graphs, 20 points. Suppose G is a simple connected graph such that G is unicyclic. Prove that V(G)=E(G). Your solution should be coherent and precise. Do not leave out any details whatsoever. Write complete sentences. Lack of clarity and precision will result in point deductions. Be sure to state any theorems that you use. 4. Unicyclic again, 20 points. TRUE or FALSE (circle one): A simple graph with n vertices and n edges is unicyclic. Do not justify your