A source emits letters from an alphabet A-: {a, a2, a3) with joint probabilities T 0.3 0.15 o.0s P0.05 0.1 0.15 0.1 0.05 o.os where Pij Pla.ajl Determine the optimum binary code words for the following codes (a) (b) The sequence is divided into pairs of symbols and each pair is represented by a code word; A Markov model for the source is devised and a state dependent code is used to encode each symbol A source emits letters from an alphabet A-: {a, a2, a3) with joint probabilities T 0.3 0.15 o.0s P0.05 0.1 0.15 0.1 0.05 o.os where Pij Pla.ajl Determine the optimum binary code words for the following codes (a) (b) The sequence is divided into pairs of symbols and each pair is represented by a code word; A Markov model for the source is devised and a state dependent code is used to encode each symbol