2. Edge cover: Given a graph G with n vertices and a number k,does G have a set C of k (or fewer) edges so that every vertex in Gis incident on at least one edge in the set C
a. Give a yesinstance b. Give a no-instance c. Prove that the problem is in NP
d. Is the problem in P?Explain e. Which classes is Edge Cover in: P, co-P, NP, co-NP, EXP,co-EXP
Expert Answer
An answer will be send to you shortly. . . . .