WeBWork : 20. c13 cycle grap. Mathematical S... submission su. T T At least one of the answers above is NOT correct. (8 points) This question concerns subgraphs of graphs. In all cases, when we say G, is a subgraph of G2, we mean that G, is isomorphic to some subgraph of G2. Are the following statements true or false? False + 1. K3,3 is a subgraph of K2,2. True # 2. K3,3 is a subgraph of K4,4. True # 3. C4 is a subgraph of K2,2. False + 4. P, is a subgraph of K2,2. False # 5. Every graph is isomorphic to all of its subgraphs. True # 6. Every simple graph of order 5 or less is isomorphic to a subgraph of K's. Note: In order to get credit for this problem all answers must be correct. Preview My Answers Submit Answers