Design an NFA that accepts the language of all binary strings that contain either 000 or 111 as a substring (this is not an exclusive or, so containing both should still be accepted). Give a formal proof that your NFA accepts precisely this language.