I don't want the Circuit, I want the finite state machine that represents the addition

A Full Adder accepts two input bits and an input carry and generates a sum and carry at its output side (refer to Table 1). Two or more full adders can be connected in parallel to perform binary addition operation for more than 2 bits. The input bits and input carry are denoted as A, B and Cin respectively. Construct a finite state machine that represents the addition. Table 1 A B Cin Sum Carry 0 0 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 1 0 1 0 1 1 1 0 1 0 1 0 1 1 1 1 0 0 1 1 1 1 1