Consider problem A from the previous question and answer the following question: 1. Show if a graph G=(V,E) is a yes-instance of problem A, then G does not contain a cycle of odd length. For example, the graph given by Figure 1 has 2 cycles of odd length: (1,2,5,4,3,1) with 5 edges and (2,4,5,2) with 3 edges