To prove that if "n" is any integer then 2n + 1 is always odd, which steps are required?
Select one or more:
a. Assume 2n + 1 is always even
b. then 2n must be even
c. Therefore 2n + 1 must be odd
d. Let "n" be an odd number

(01.03 mc) which of the following is a step in simplifying the expression x multiplied by y to the power of 2 over x to the power of negative 3 multiplied by y to the power of 3, the whole to the power of negative 4. select one: a. x to the power of negative 4 multiplied by y to the power of negative 2, the whole over x to the power of negative 7 multiplied by y to the power of negative 1. b. x to the power of negative 4 multiplied by y to the power of negative 8, the whole over x to the power of 12 multiplied by y to the power of negative 12. c. x to the power of negative 4 multiplied by y to the power of negative 8, the whole over x to the power of negative 3 multiplied by y to the power of 3. d. x to the power of negative 4 multiplied by y to the power of negative 2, the whole over x to the power of negative 3 multiplied by y to the power of 3.