(Question variant: 11b2eb22) The problem VERTEX-COVER takes as input a graph G = (V, E) and integer k > 2 and returns True if G contains set of nodes of size k that are all mutually connected. Show that the problem belongs to the class NP by describing a non-deterministic algorithm for VERTEX-COVER that runs in polynomial time. B 1 82 M *