Stuck on this question dealing with creating a finite automation using a GCD between two numbers.

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