Strings are defined over an input alphabet ={a,b,c} as follows: A(n,m,k)=anmod4b2mckmod3,n1,k1,m0 where mod is a function such that x mod y gives the remainder when x is divided by y. For example, 5mod3 is 2. Let L be the language generated by the strin gsA(n,m,k). Design a Finite Automaton M to recognize the language L