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.