Question $2$: Consider the framing protocol where the start and end of frames are marked by the flag byte $01111110.$ To ensure that this pattern never appears in normal data, a $0$ bit is stuffed after every five $1$ bits in the data. Suppose a network device captures the following bit sequence on the link layer $($read left to right$)$: $100111110100000000011111010110111111101101111101000001001111110$ Show the resulting frame after any stuffed bits have been removed. Indicate stuffed bits that have been removed by $*,$ any errors that might have been introduced into the frame by $$err$$ and flag byte by $$f$.$