4. Let k be a positive integer constant. Let Lk be the language over {a,b) defined as follows: Lkw E a, b the number of a's in w is not divisible by k For example, 2 wE a,bcontains an odd number of a's. (a) Draw the state diagram of a finite automaton that accepts L (b) Give the 5-tuple (and specify all its elements, including the transition function) that ibes your f anoai rm pari (a) (c) Give a 5-tuple specifying finite automaton My such that L(A4) = 4 (Do not use a transition table to specify In general, you should only ever use a transition table if you can list all entries in the table