5. [10 marks] An NFA in an Economy of States Let s E -{a}*. Let l s| denote the length of string s. Construct a finite automaton in less than two dozen states that recognizes the language L = {s : gcd(Isi, 504)-6). where gcd(x, y) denotes the greatest common divisor between two numbers r, y