2) For each of the finite state machines above, use the sets derived in part 1) to produce the following:   i.                  a set of sequences that execute each transition ii.                 a transition tour iii.               a set of sequences that contain each transition followed by sequences that check its final state 3) For each FSM in part 1) that has a UIO for each state, produce a tour that includes a test subsequence for each transition. That is, you need to follow each transition and then check (with a UIO) that the right final state is reached.