I need this to be drawn out on paper or using JFLAP, I just need help figuring out how to solve this DFA.

Assumptions for this exercise ... - Alphabet ={a,b} - For any string w over ,na(w)= the number of a 's in w. - For any string w over ,nb(w)= the number of b 's in w. To do in this exercise ... - Use JFLAP to define a Deterministic Finite Accepter M such that L(M)={w:na(w)=2nb(w)>3}. - Save your Determinsitic Finite Accepter as a file, and submit that file to Canvas as your solution to this exercise