$($b$)$ Draw deterministic finite state automata to recognise the following

regular languages over the alphabet $\{0,1\}$ of binary strings:

$($i$)$ The language consisting only of the string $01.$