b) Consider a scenario where fragmentation may take place in packet transfer. Discuss how such fragmentation may be reassembled at the destination. Now consider in such scenario, a datagram is fragmented into five fragments. The first four fragments arrive, but the last one is delayed. Eventually, the timer goes off and the four fragments in the receiver’s memory are discarded. A little later, the last fragment arrives. What should be done with it?

The following  bit stream : 0111110001010011111111100101111111111110 represents data that needs to be framed by the link layer on the sender’s side. Derive the resultant bit stream by adding necessary flag bits and performing bits stuffing.  assume that the link layer uses the flag bits with bit stuffing approach for framing, with the following details: The beginning and end of a data frame are indicated by the special flag bits 01111110 (i.e., 0x7E). To handle accidental occurrence of the flag bits within the data, a 0 bit is stuffed every time 5 consecutive 1s are found in the data. For simplicity, assume that no other header/trailer information is added to the data. I got this answer below but it is wrong. 0111111001111100001010011111011110010111110111111011001111110

Please draw a flow diagram

Just give the correct option no need explanation