3. Let T be a tree, n = N, and let {T,...,Tn} be a set of...

Transcribed Image Text:

3. Let T be a tree, n = N, and let {T,...,Tn} be a set of subgraphs of T such that every T is a tree. (a) Show that if Nie[n] Ti , then Ni[n] T is a tree. (b) Show that if T; T; for all i, j = [n], then Nie[n] Ti is a tree. 3. Let T be a tree, n = N, and let {T,...,Tn} be a set of subgraphs of T such that every T is a tree. (a) Show that if Nie[n] Ti , then Ni[n] T is a tree. (b) Show that if T; T; for all i, j = [n], then Nie[n] Ti is a tree.