Continue with the same network availability model from the previous problem. Engineers decided to...
9. Consider the following hidden Markov model (HMM) (This is the same HMM as in the previous HMM problem): ·X=(x, ,x,Je {0,1)、[i.e., X is a binary sequence of length n] and Y-(Y Rt [i.e. Y is a sequence of n real numbers.) ·X1~" Bernoulli(1/2) ,%) E Ip is the switching probability; when p is small the Markov chain likes to stay in the same state] . conditioned on X, the random variables Yı , . . . , y, are...