Suppose that we have a regular language L over the alphabet $\{0,1\}.$ Suppose that for a given positive integer n we create the language L$|$n which consists of those strings in L of length at least n$.$ For a given n$,$ the language L$|$n is:

not necessarily regular