need help

This question concerns subgraphs of graphs. In all cases, when we say G1 is a subgraph of G2, we mean that G1 is isomorphic to some subgraph of G2. Are the following statements true or false? 1. P4 is a subgraph of K2,2. 2. K3,3 is a subgraph of K2,2. 3. If a graph is connected, then so too are all of its subgraphs. 4. If a graph is contains no cycles, then none of its subgraphs contain cycles. 5. K2,2 is a subgraph of K4. 6. Every bipartite graph is isomorphic to Km,n for some values of m and n