2. Edge cover: Given a graph G with n vertices and a number k,does G have a set C of k (or fewer) ed

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 Attached

 

Looking for a Similar Assignment? Hire our Top Uk Tutors while you enjoy your free time! All papers are written from scratch and are 100% Original. Try us today! Active Discount Code FREE15