## Simple way to prove $\left \{ 0^{n}1^{m} \mid (n-m) \bmod 5=0 \right \}$ is regular?

Prove: $$\left \{ 0^{n}1^{m} \mid (n-m) \bmod 5=0 \right \}$$ is regular.

Is it reasonable to get a DFA with at least 30 states for this language? is there an easier way to prove it is regular?