(a) prove that every graph of order and size contains as a subgraph
(b) describe the graphs of order and size that do not contain as a subgraph
I see that you have some other postings, more than 170.
You should understand by now that this is not a homework service nor is it a tutorial service. Please either post some of your own work on these problems or explain what you do not understand about the question.