Give an inductive proof that a series of n bits (each bit can be 0 or 1) can express 2 possible binary values. Hint: let P(n) be the number of values which can be represented by n bits. Refer to CSC121 ClassNoteOpt: Inductive Proof. Prove the following: 1) State that P(1) is true; 2) Assume when n = k, P(k) is true; 3) Prove that P(k+1) is true based on 2)