Please answer both parts

IS - Independant Set CL - Clique VC - Vertex Cover TAKEAWAY: reduction really means transformation; the output is frequently LARGER than the input.

To show CL Sp VC (read CL is reducible to VC"), the P-time transformation should: (a) Transform every instance of CL into some instance of VC, and arrange that the budget for the output instance is an increasing function of the budget" for the input instance. (b) Transform every instance of VC into some instance of CL, and arrange that the budget for the output instance is an increasing function of the budget" for the input instance. (c) Transform every instance of CL into some instance of VC, and arrange that the budget for the output instance is a decreasing function of the budget" for the input instance. (d) Transform every instance of VC into some instance of CL, and arrange that the budget for the output instance is a decreasing function of the budget for the input instance. To show P