Under Time Division Multiplexing, a user is allowed to transmit packets of information only at times, $0,1,2,...,$ one packet at a time. If the user has no packets at time n$,$ he$/$she has to wait until time n $+1$ to transmit, even though new packets may arrive between time n and n$+1.$ During time n to n$+1,$ i new packets arrive with probability ai $($for i $=0,1,...).$ Let Xn be the number of packets awaiting transmission just before time n$.$ Model $\{$Xn$,$ n $0\}$ as a DTMC$.$