Need help drawining these.

Draw deterministic finite acceptors for the following languages over ={a,b}. a. Strings with at most 2 b's b. Strings with at least two a's and exactly one b c. Strings that contain the substring aab d. Strings with a multiple of 4b 's e. Strings with a length that is not a multiple of 3 ( 0 is a multiple of 3 ) f. Strings that start with a or end in b (or both, singleton strings a and b are accepted too, but not )