Construct finite-state machines

Construct finite-state machines that act as recognizers for the input described by producing an output of 1 exactly when the input received to that point matches the description. (The input and output alphabet in each case is (0, 1}.)

a. set of all strings containing exactly one I

b. set of all strings beginning with 000

c. set of all strings where the second input is 0 and the fourth input is 1

d. set of all strings consisting entirely of any number (including none) of 01 pairs or consisting entirely of two is followed by any number (including none) of Os

e. set of all strings ending in 110

f. set of all strings containing 00