The nagle algorithm, built into most tcp implementations, requires the sender to hold a partial segment’s worth of data (even if pushed) until either a full segment accumulates or the most recent outstanding ack arrives. suppose the letters abcdefghi are sent, one per second, over a tcp connection with an rtt of 4.1 seconds. draw a timeline indicating when each packet is sent and what it contains.