I am trying to understand this problem and yes this is from my assignment and I should be doing it myself, but I have been staring at it for 2 hours and not getting anywhere, so decided to post it here.
Let G be a connected cubic simple graph that contains 2 edge-disjoint spanning trees show that |G| = 4.