You are given three lists A, B, and C. List A contains the numbers of the form 10k in base 10, with k any integer greater than or equal to 1. Lists B and C contain the same numbers translated into base 2 and 5 respectively: A101001000⋮B101011001001111101000⋮C2040013000⋮. Prove that for every integer n>1, there is exactly one number in exactly one of the lists B or C that has exactly n digits. floor functionlogarithmsIrrational numbers