Consider the problem Find-Clique defined as follows: Given a graph G and a number k as input, find a clique of size k in G if one exists. Recall the Cliquedecision problem: Given a graph G and a number k, does G contain a clique of size k?. Give a polynomial-time reduction from Find-Clique to Clique