Prove that the size of the maximum matching for the following graph is four. Give a maximal matching that is not maximum. 5 6 7 3 8 9 (10) (b) (2p.) Using Handshaking lemma, prove that the average degree of any tree is O(1).