A useful control mechanism in many DES is a timeout, where some state transition is forced

to take place when a $$timeout event$$ occurs. Suppose a computer processor operates as

follows. When a job arrives, it is broken down into two tasks. First, task $1$ is executed, and, if

execution is successfully completed, then task $2$ is executed. If the execution of task $2$ is also

successfully completed, then the job is done, and it leaves the system. If$,$ however, task $1$ takes

too long, a timeout event is generated, and the entire job leaves at once. Similarly, if task $2$

takes too long, another timeout event is generated, and the job leaves. Assume the system has

a total capacity of one job. Four events are required to model this process: Job Arrival,

Successful Completion of Task $1,$ Successful Completion of Task $2,$ Timeout. Based on this

set of events, build an automaton to represent this process $($three states should suffice$).$