A computer device can be either in a busy mode (state 1) processing a task, or in an idle mode (state 2), when there are no tasks to process. Being in a busy mode, it can finish a task and enter an idle mode any minute with the probability 0.2; while being in an idle mode, it receives a new task any minute with the probability 0.1 . Assuming that the state of the device can be modeled using discrete time Markov chain {Xn, n=0,1,2,...} {
X
n
,
n
=
0
,
1
,
2
,
.
.
.
}
, where Xn
X
n
is the state of the process after n
n
minutes and that the the device’s initial state is in idle mode; the steady-state distribution of the process is