$(20$ pts$)$ Using a polynomial time reduction from VERTEX$-$COVER show that the following language,

which checks whether at least two distinct $k-$node vertex covers exist in a graph $G$ is also NP$-$complete:

is an undirected graph that has at least two distinct $k-$node vertex covers