Need help constructing a Deterministic Finite Automata with AT MOST I am stuck with constructing an DFA that has at most in it. 

The question I am stuck with is:


  Design an DFA that accepts all strings over {0, 1} that contain at most two 00’s and at most three 11’s as a substring.


An answer in a form of a graph would be perfect but if someone can explain in plain words, I will appreciate that as well.
You can use states of the form $(i,j)$ where $i$ counts the number of 00s and $j$ counts the numbers of 11s read so far.