2. (a) Show that there is no tree with odd order such that the degree of every vertex belongs to the set {1,3,5}. [3 marks] (b) Prove that any connected graph which contains at least one bridge must have at least two odd vertices. [3 marks]

Fig: 1