Construct an unambiguous grammar for the above Finite Automata.

Use strings of decimal (i.e., base 10) digits that correspond to multiples of three. This grammar should use the ten digit symbols, 0, 1, 2, ..., 9 as individual tokens; no other tokens should be included. The empty string, as well as strings with leading zeros, are permitted.

Examples: "" "0" "3" "1 2" "7 8" "1 6 2" "0 7 1 7"

Example: multiples of 3 0,3,6,9 I,4,7 4.7 0,3,6,9 0,3,6,9 2,5,8 2,5,8 2,5,8 4,7 a number is divisible by three if the sum of its digits is divisible by three