Let G be a connected graph with k (> 0) vertices of odd degree. (i) Show that the minimum number of trails, that together include every edge of G and that have no edges in common, is k/2. (ii) How many continuous pen-strokes are needed to draw the diagram in Fig. 6.8 without repeating any line?