Can I please receive help with question 4 b using steps i-vi.

Complete each of the following: a. State the denition of a spanning tree. b. Prove the theorem below by following the indicated steps. {Proof attempts that do not follow these steps will receive no credit.) if a connected graph G does not have a unique spanning tree, then G contains a simpie cycle. i. Begin by letting G be an arbitrary connected graph with 'n. yertices, and state your starting assumption for the proof. ii. State that G must then have two distinct spanning trees T1 and T2. iii. Sketch a diagram illustrating G, T1, and T2. (Note: your proof should n_ot rely on your diagram.) iy. Consider T1 U T2, and in particular state how many yertices and edges T1 U T2 N H has, and why. Use phrases like \"at most, at least," or "exactly.\" y. Deduce how many edges the graph G must have. Use phrases like "at most," "at least," or "exactly.\" yi. Explain why this means G must contain a simple cycle