PLEASE ONLY ANSWER IF YOU KNOW WHAT AN NFA OR DFA IS !!!!! Either is fine- I need a FINITE STATE MACHINE as an answer.

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