Suppose that the number of jobs in a processor may be modeled by a Bernoulli Single-Server Queuing Process with a frame size of 3 seconds. Assume the capacity equals 3 jobs maximum (that is, the number of jobs in the system is 0, 1, 2, or 3). The average arrival rate equals 4 per minute. The average time to process a single job (once it's in the system) equals 10 seconds. Set up the Markov chain transition matrix and find the long-term forecast. How often will the system be idle? How often will the system be at full capacity