a) Consider bit-stuffing (also known as bit-insertion) the way presented below. Consider k = 2. If the data bits of the frame to be sent are

1110011010110011101

what are the actual bits sent by the sender? Please include some idleness bits before and after the frame.

b) Is it possible to have k=1? Why or why not?

Bit Insertion (a.k.a. bit stuffing) bits Why? to maintain bit synchronization using manchester encoding in a synchronous sysiom on now on w lignore physicall blits, and consider onlly dlanea bis L.e., the physical bits received are decoded using manchester and the result is an infinite stream of data bits But, what if the sender is "idle", i.e., which data bits are "idle" bits and which are "true" data bits? To determine this, one common technique is bit stuffing