Use pumping lemma to prove that the language is not regular.

B = {w | w = (101)ⁿ, n > 2}