Information is inserted into a FIFO buffer at a rate of m bytes per second. The information is deleted at a rate of n byte per second. The maximum capacity of the buffer is k bytes. 

a. How long does it take for an empty buffer to fill up when m > n? 

b. How long does it take for a full buffer to empty when m < n?

c. Is the FIFO buffer needed if m = n?