please create using JFLAP so i can understand it

Create an acceptor Thring machine with the following properties: the machine accepts strings containing at least three G's and at most two T's and any number of A's and C's; all other strings are rejected. Criteria for Success: You have a JFLAP file for a Turing Machine with one tape that accepts the given language. Use the TM states to keep track of how many G's and '"'s have been seen rather than trying to create a counter. It is important to make sure in your Turing machine preferences that you accept by final state only so uncheck the accept by halting in the preferences window