Consider again the Grasshopper Markov Chain from Chapter 4b, with a state varlable S={4,3,2,1,0,+1,+2,+3,+4} and with the grasshopper known to start in position 0:P(S(0))=[0,0,0,0,1,0,0,0,0] : Let's turn this into a Hidden Markov Model by assuming that we cannot see the grasshopper, but we hear it chirping (observation variable Chirp(C)), with the sound coming from the left, the center, or the right (Val(C)={l,c,r}). Suppose we have the following observation model: Finally, suppose we have an observation sequence of Chirp observations of length T. Which of the following sentences are correct: The backward message b(1:T)[1/9,1/9,1/9,1/9,1/9,1/9,1/9,1/9,1/9] Select one: True False