Solve the following problem:
Determine the state transition graph for the sequential machine which recognizes the set S of binary sequences consisting of n zero values followed by m values equal to 1, i.e., S = {0n1m}, where n ≥ 1, and m ≥ 0.
Make sure you use enough details to support your answer.