please show your work

2. Definition: A tree is a connected graph with no cycles. Let C(G) be a decider for the language LCONNECTED = {GG is a simple connected graph} Prove that the following program T(G) is a decider for the language LTREE = {GG is a tree). Remember: in order for something to be a decider, it must accept all inputs in the language and reject all inputs that are not in the language. T 1. 2 on input G: Run C(G) and reject if it rejects For each edge e of G: GG without the edge e Run C(G) and rejectif CG accepts Accept 4 5 en