Disprove the following statement by giving a counter-example. Claim: For every tree T = (V, E¡) and tree T2 = (V,E2) where V2 3 and E¡ N E2 = 0, the graph G = (V, E1 U E2) is 2-connected. Clearly...

Extracted text: Disprove the following statement by giving a counter-example. Claim: For every tree T = (V, E¡) and tree T2 = (V,E2) where V2 3 and E¡ N E2 = 0, the graph G = (V, E1 U E2) is 2-connected. Clearly indicate what T1 and T2 are and motivate why the resulting graph is not 2-connected. (Create the counter-example in any drawing editor and include it as an image in your answer.)