What is the second step in proving by mathematical induction that for ever positive integer n, 11ⁿ-6 is divisble by 5, is true?
◯ Let n = k. Then assume that 11ᵏ - 6 is divisible by 5.
◯ Let n = 1. Then assume that 1¹ - 6 is divisible by 5.
◯ Let n = k. Then assume that 11ᵏ⁺¹ – 6 is divisible by 5.
◯ Let n = (k + 1). Then assume that 11ᵏ - 6 is divisible by 5.
