Consider a reliable sliding window protocol with:
	 Maximum packet size: 1KB.
	 Maximum network BW: 1MB/s
	 Latency: 100ms.
	 Sequence numbers describe bytes.
	 
Assume that the network loses, but does not reorder, packets.	 


0. If there are twelve eggs in a carton, and it takes 1 hour to drive
   at 30 MPH a carton of eggs to the store and come home, how many
   eggs can a farmer deliver to the store in an 8 hour work day if he
   drives one carton at a time?

   	 
	 
1. In steady state, assuming no loss, what is the maximum BW that the
   network described above can deliver?
   
   
2. To achieve this, how big (in bits) must the sequence number be?
     
   
3. How big (# bits) must the advertised window size be in order to
   ensure an effective BW of at least .1MB/s