Create a JFLAP TM, and include the .jff file in the zip archive. 10 extra credit points for the minimal solution. ∑ = {C

[answerhappygod]

Create a JFLAP TM, and include the .jff file in the zip
archive. 10 extra credit points for the minimal
solution. ∑ = {C,A,G,T}, L = { w :
#C(w) > #A(w)
and #C(w) % 3 >
#A(w) % 2}. The file test_cases.txt,
included with the test materials, might be useful. Here are the
expected results and the explanations:
Input String
Result
Explanation
C
Accept
More C's than A's; #C(w) % 3 = 1
> #A(w) % 2 = 0}.
ACC
Accept
More C's than A's; #C(w) % 3 = 2
> #A(w) % 2 = 1}.
AGCTTCCG
Reject
#C(w) % 3 = 0 < #A(w)
% 2 = 1}.
AGCTTCG
Accept
More C's than A's; #C(w) % 3 = 2
> #A(w) % 2 = 1}.
AGCTTCACG
Reject
#C(w) % 3 = 0 = #A(w) %
2 = 0}.
TACCACCG
Accept
More C's than A's; #C(w) % 3 =
1> #A(w) % 2 = 0}.
GAGAGCT
Reject
Fewer C's than A's.