Construct a NFSA with at least one e-moves to accept the following language.

{The set of strings of 0s and 1s such that at least one of the last ten positions is a 1.}