$(10$ points$)$ Pick ONE of the following to do$.$

Is the language NO$-$CLIQUE defined below NP$-$HARD? Answer clearly, and provide a convincing proof to support your answer. Hint: How could you reduce from CLIQUE?

NO$-$CLIQUE is an undirected graph without a clique of size $k$

Let One$-$Out Path be a variant of Path on a directed graph $G$ where each vertex has at most one outgoing edge. Show that One$-$Out Path is in $L.$