5. For n 4 and every of the three properties below, determine* all n-vertex simple graphs G satisfying this property: (a) every induced subgraph H with 3 vertices of G is isomorphic to the path P3 with two edges; (b) every path contained in G is an induced subgraph of G; (c) every induced subgraph of G with 3 vertices has either 2 or 0 edges.