Show that the following languages are in NP by describing and analyzing an efficient verifier for each: (a) HaM-CYCLE G: G is an undirected graph with a Hamiltonian cycle} (b) INTEGER-PARTITIONING c N:3 1-A such that (c) COMPOSITES = {n N: n = pq for some integers p, q > 1} a-LaEAV a} Show that the following languages are in NP by describing and analyzing an efficient verifier for each: (a) HaM-CYCLE G: G is an undirected graph with a Hamiltonian cycle} (b) INTEGER-PARTITIONING c N:3 1-A such that (c) COMPOSITES = {n N: n = pq for some integers p, q > 1} a-LaEAV a}