$4.$ For $<=\{$a$,$b$],$ construct DFAs that accept the sets consisting of $($a$)$ all strings with exactly one a$,($b$)$ all strings with at least one a$.$