2. Argue that each of the following problems is or is not in NP (note that this is a tricky (a) Given a weighted graph G = (V, E) and an integer k, is there at least one tour with cost (b) Given a weighted graph G- (V, E) and an integer k, is the number of tours with cost (c) Given a weighted graph G (V, E) and an integer k, is the number of tours with cost problem). A tour is a Hamiltonian Cycle. k equal to one million? k greater than or equal to one million? (d) Given a weighted graph G (V, E) and an integer k, does the one millionth-shortest tour have cost k? Assume that no two different tours have the same cost. 2. Argue that each of the following problems is or is not in NP (note that this is a tricky (a) Given a weighted graph G = (V, E) and an integer k, is there at least one tour with cost (b) Given a weighted graph G- (V, E) and an integer k, is the number of tours with cost (c) Given a weighted graph G (V, E) and an integer k, is the number of tours with cost problem). A tour is a Hamiltonian Cycle. k equal to one million? k greater than or equal to one million? (d) Given a weighted graph G (V, E) and an integer k, does the one millionth-shortest tour have cost k? Assume that no two different tours have the same cost