a) Produce the state diagram for an NFA which recognizes all binary strings that contain 01 or end in 11 or both. Assume = {0,1} (10 points) b) Produce the state diagram for an NFA which recognizes all binary strings which do not contain '101'. (15 points) c) Give the formal definition 5-tuple of the NFA from part c) (5 points)