5. Prove that any connected graph in which every edge is contained in an odd number of cycles must be eulerian. [6 marks] 1

Fig: 1