I am trying to understand this problem from [Algorithms. by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, chapter8][1], Pg281. Problem 8.19

A kite is a graph on an even number of vertices, say 2n, in which n of the vertices form a clique
and the remaining n vertices are connected in a “tail” that consists of a path joined to one of the
vertices of the clique. Given a graph and a goal g, the KITE problem asks for a subgraph which
is a kite and which contains 2g nodes. Prove that KITE is NP-complete.

Any pointers to start with this problem? I am completely lost with it.

  [1]: https://docs.google.com/viewer?a=v&q=cache:zCRhhxjqT5cJ:www.cs.berkeley.edu/~vazirani/algorithms/chap8.pdf%20&hl=en&gl=us&pid=bl&srcid=ADGEEShy1bvJEehdocFNfXKJs7p_TSog4n_ktXYth1MI0n1aUBo_L5Wbd-gzn5OH3QMnAv8mHqNKXJ8t1CXv3rle7avzGFVFN7DliQEASoN2ikYTFglAz_PSPA9K1TW1nY9ybkd3w4OV&sig=AHIEtbTJ6FYl_HzkdU7W-mDJO3BB27sKqw