Give me the answer by showing me the tree of 21 reachable states label the tree states like 1 1 F F A The book gives claim that there are only 21 reachable states in the system with 128 states and that a state of the type (4,4,.....) is not among those 21. in System and Software Verification book there is a claim: if I have 2 systems A and B As you see in those two images there are A and B systems have 4 states in both, and rA take two values T or F and, rB also take two values T or F, and turn take two values A or B. the synch Product will be : A * B * rA * rB * turn ====> 4 * 4 * 2 * 2 * 2 =128 states

ch wil,--be tur be couyey