Complexity:200/230
Speed:7.00/8.60
Same trick as in chapter 1, let the input as conditions to induct the flowchart.

Complexity:320/320
Speed:9.25/20.08
The idea is using different nodes themselves as the current total value states, which leads to fast speed.
Also, follow all the given cases, some of the state changing arrows can be neglected.
So this solution would only be a specific tricky solution for the given test cases.

Complexity:450/510
Speed:17.75/20.50
repeat using those adder for +1/+2/+4
using mapping node for +8
you can also change +4 for mapping to, slightly increase complexity with great increase in speed

Complexity:310/370
Speed:18.29/23.35
The idea is simple and straight forward
Use 4 different states to represent 000 001 011 111
and record whether you have extra 1 from last layer by two states
optimization by using specific conditions would work even with conflicts showing warning marks