Do NOT use hand-writing

Type the answer plz

For the next two problems, consider the following (flawed) claim. Claim: 2n = 0 for all nonnegative integers n. The following is an attempt to prove the claim Base case: if m 0, then 2m 0. The claim holds for the base case. Inductive step: Consider any integer m > 0. Assume 2k 0 for all integers k such that 0 k