Proof language A= { 0^i 1^j where j>(i mod 3), j >=0 , i>=0} is regular language

I know that A is a regular language, since we can construct the DFA or the NFA, but i dont know how to construct it, Can somebody help me please? Thank you