Design an NFA (showing just the state diagram) for the following language, using only 6 states:

{w {1, 2, 3, 5}* : w has at least two occurrences of some symbol }