4.3.5. This problem involves 4B5B and MLT-3.
(a) Encode 1101 0011 0001 using 4B5B. Then encode the result into MLT-3. For MLT3, assume the state on the first symbol is +.
(b) Decode ++0– 0++0- -00++ via MLT-3 and then 4B5B if there is no apparent error
in the sequence; if there is an error, decode the sequence as far as possible and then
state the nature of the error. For MLT-3, assume the first bit is a 1.
(c) Repeat part (b) with +00– –00+ +00-0.
(d) Repeat part (b) with +0-00 00+0+ 0—0