pls design the machines graphically so I can know what it looks like. I will be using this to study from.

4. Consider alphabet ={0,1}. (a) Design a finite state machine that accepts all strings that end with 01 . (b) Design a finite state machine whose language includes only the empty string