1. Using his intuition that languages accepted by finite automata require remembering only a finite pattern, Sheikh Chilly would like to argue that the following language Ln is not regular. Obviously, he argues, remembering multiples of a given integer n requires unbounded memory. For the alphabet = {0,1}, let the language Ln be given by Ln = {w E* | w is a binary number that is a multiple of n}, for n > 1. Show that for all valid choices of n, the language Ln is regular