1. Write a program (In C) to implement bit stuffing & Destuffing. Theory: Bit Stuffing: In a data link frame, the delimiting fiag sequence generally contains six or more consecutive 1s. In order to differentiate the message from the flag in case of the same sequence, a single bit is stuffed in the message. Whenever a 0 bit is followed by five consecutive 1bits in the message, an extra 0 bit is stuffed at the end of the five is. Bit De-stuffing: When the receiver receives the message, it removes the stuffed Os after each sequence of five 1s. Output (Example): Erter bits as i1 IKII eta after stuffisgel10 RLIALI1 1 1I Deta After de staffing BIEIHLILI19I rocess returred e (h) eSEution time : 20.3 s Press ay key to contine. LL.