State graphs for two sequential machines are given below. The first graph represents a correctly functioning machine, and the second represents the same machine with a malfunction. Assuming that the two machines can be reset to their starting states (S0 and T0), determine the shortest input sequence that will distinguish the two machines.
![2236_cf1e870d-c76f-4365-8a3b-a63aa555e457.png](https://secure.tutorsglobe.com/CMSImages/2236_cf1e870d-c76f-4365-8a3b-a63aa555e457.png)