Draw a state transition graph for a simple combination lock. The lock machine has ten inputs 0-9 plus a reset input. The combination is entered as a sequence of three values to the ten numeric inputs; the reset input can be used to start over. When the correct combination (use 345 as the combination for this example) is found, the open output is asserted.