Let n be a positive integer. Show that a subgraph induced by a nonempty subset of the vertex set of Kn is a complete graph.

34 Do this problem in 2 parts: (a) (5 points) Let W be an arbitrary subset of vertices of Kn. Let H (W, F) be the subgraph induced by W. Now reword problem 34 as a conditional statement (if-then statement), clearly stating the assumptions. (b) (10 points) Now prove the conditional statement using one of our standard proof techniques. Hint: review Definitions 7 and 8 in the reading