A computer system operates with two parallel processors P1 and P2. The total capacity (queue and server included) of P1 is K = 1, and that of P2 is K= 2. The system receives two types of jobs, labeled J and J. Jobs of type J must be processed at P1, and jobs of type J must be processed at P2. When a job is processed, it leaves the system. If a job finds a full queue upon arrival, then the job is simply rejected. Build an automaton model of this system.