NOTE: This is a multi-part question. Once an answer is submitted, you will be unable to return to this part. Use strong induction to show thhat every positive integer n can be written as a sum of distinct powers of two, that is, as a

sum of a subset of the integers 2⁰ 1,2¹=2,2² =4, and so on
Let P(n) be the proposition that the positive integer n can be written as a sum of distinct powers of 2
Which is the correct basis step? (You must provide an answer before moving to the next part.)

Multiple Choice R

a. P(0) states that 0 can be written as a sum of distinct powers of 2, which is true because 2⁰ + 2⁰.
b. P(1) states that 1 can be written as a sum of distinct powers of 2, which is true because 1 = 2⁰
c. P(1) states that 1 can be written as a sum of distinct powers of 2, which is true because 1= 2⁰+2¹
d. P(0) states that O can be written as a sum of distinct powers of 2, which is true because 0 = 2⁰