A simple way to prove that $ left {0 ^ {n} 1 ^ {m} | (n-m) mod5 = 0 right $

given $ left {0 ^ {n} 1 ^ {m} | (n-m) mod5 = 0 right $. prove regularly.
Is it reasonable to get a DFA with at least 30 states for this expression? Is there a simple way to prove that this language is regular?