NOTE: The other answers on Chegg for this question are incorrect and if you copy them, you will be reported. In this question, you draw the NFA.

Construct an NFA for the language of all strings over the alphabet {a,b,c} that accepts any string that contains at least one substring of the form aaa, bbb or ccc. For example, the string abcabaccccabcaa belongs to this language because it contains the substring ccc, twice actually. The string bcabaacabada contains neither aaa, bbb nor ccc as a substring. So it does not belong to this language. Marking Scheme