Select all the steps that have to be included into the Reduction step of the Vertex Cover (VC) problem. Note that incorrect choices are penalized. Select one or more: A. Claim that VC is NP-hard B. Claim the reduction from NP-hard IS problem to VC C. Set parameters for IS problem to GIs = Gvc and kis = n-kvc D. Show that IS-> VC reduction is done in O(const) time E. Set parameters for IS problem to GIs to a complement of Gvc and O F Show that VC-> IS reduction is done in O(n2) time for constructing graph complement O G. Show correctness of the reduction H. Claim that IS is in NP class