For each part below, find a finite automaton M which satisfies the given description. Describe M using a state diagram and give a table form of the transition function.

(a) The language accepted by M is the set of all binary strings which have no leading 0s (so they represent a binary number in standard form) and contain at least 3 1s.

(b) The language accepted by M is the set of all binary strings s such that, viewed as an integer, s is divisible by 4.

(c) The language accepted by M is the set of all binary strings s such that, viewed as an integer, s is divisible by 3.