Question $4$

$==========$

Consider the bit insertion protocol. There are several ways to encode "idleness"

a$)0111111111111111111111111110($i$.$e$.,$ a $0$ followed by more than $6$ ones$)$

b$)0111111011111111111111111101111110($i$.$e$.$ the $01111110$ flag, then many ones, then the flag again$)$

c$)01111110011111100111111001111110($i$.$e$.$ many flags in a row$)$

Argue that the receiver pseudocode $($that we gave in the slides$)$ will throw

away all of these bits $($i$.$e$.$ it will consider them idleness and throw them

away$)$ PLEASE NO AI ANSWER