Consider an infinite data stream that is equal to $..\mathrm{.}110110110...,$ i$.$e$.$ the string $110$ is repeating.

It is required to:

a$)(9$ points$)$ Use the provided grid to encode the following $9$ bits $110110110$ of the infinite

stream using each of the following encoding schemes: NRZ$-$I, AMI, and Manchester. The

required initial conditions are as indicated in table.

b$)(3$ points$)$ Compute the average number of signal transitions per bit time for the infinite

data stream for each of these encoding schemes. Show your work.

c$)(3$ points$)$ If the data is transmitted at R$=500$ kb$/$s$,$ estimate the needed practical

bandwidth for each of the encoding schemes covered in part $($a$)$