1. Give AFD (deterministic) state diagrams that recognize languages ??to follow. Do not forget to mark who the initial state is and who the final states are. In all cases the alphabet is {0,1}:

1.{w | w is any string except 01 and 101}.

2.{w | w contains an even number of 0's or contains exactly three 1's}