7. (10 pts) Design an an NFA to recognize the following language, and explain how your NFA works. L = {x over {0, 1} | x contains substring 010 or substring 101 }