Can someone make these diagrams for me please?

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}

b) Produce the state diagram for an NFA which recognizes all binary strings which do not contain 101

c) Give the formal definition 5-tuple of the NFA from part c)