2.16 Deriving state diagrams A bit-serial binary adder receives two unsigned numbers beginning from their least significant bits and produces the sum in the same manner. a. Viewing this adder as a Mealy machine, construct its state diagram (you need two states). b. Implement the Mealy machine of part a without D flip-flop. c. Repeat part a for a Moore sequential machine (four states are required). d. Implement the Moore machine of partc will D flip-flops