6. [16 marks] An NFA in an Economy of States (PA2, PA3, 11) Let S I = {a}'. Let |s| denote the length of string s. Construct a finite automaton in less than two three dozen states that recognizes the language: L = {s: gcd(s), 504)26}, where ged(x, y) denotes the greatest common divisor between two numbers x, y. 6. [16 marks] An NFA in an Economy of States (PA2, PA3, 11) Let S I = {a}'. Let |s| denote the length of string s. Construct a finite automaton in less than two three dozen states that recognizes the language: L = {s: gcd(s), 504)26}, where ged(x, y) denotes the greatest common divisor between two numbers x, y