Give state diagrams for NFAs that have the specified number of states and recognize the following languages where = {1, 0}.

A) L = {w | w is in ^* and w contains the substring 0101 so w = x0101y for some x, y} using only 5 states

B) L = {w | w is in ^* and w contains an even number of 0s or contains exactly two 1s} using only 6 states