PLEASE I NEED THE ANSWER FOR EXERCISE 4!!

4. Find the minimum code of the tree T in the picture below. Verify if I is isomorphic with the tree that has the minimum code 000010101100111000111011. Explain your answer. 10b 5. Is the graph K 7,7 Eulerian? If not, find the minimum number of edges to add to K7,7 to create an Eulerian graph. Explain your result while drawing the resulting graph. 10b 6. Use the greedy (Kruskal's) algorithm to find the minimum spanning tree of the graph G. Describe the algorithm briefly. Do not write on this paper. 10b 7. Write clearly which are the true (T) statements in a) through e) and which are false (F). Don't write on this paper! 10b (a) Each two disjoint events are independent. (b) Every regular graph with 5 vertices of degree 9 has 45 edges. (c) Every path in a graph is also a trail. (d) The graph with the degree sequence (4,4,4,4,3,3,3) has 21 edges. (e) The vertex-connectivity of graph G is at most (G). 19 U10 U11 U12 2 co 3 3 2 3 5 3 V6 2 U7 3 3 US US 6 1 1 4 4 2 2 4 G T 3 5 6 01 S U2 03 14