Assume a 15Mbps link between two hosts x and y. A TCP Reno connection is used for communication between these two hosts. Further, assume that this link is the only congested link between x and y. Now suppose that x wants to send a huge file to y, and the y’s receive buffer is much larger than the congestion window. Consider that each TCP segment size is 1,200 bytes and RTT = 160 msec; and, this TCP connection is always in congestion avoidance phase (ignore slow start). a) What is the maximum window size (in segment) that this TCP connection can achieve?
b) What is the average window size (in segment) and average throughput (in bps) of this TCP connection?
c) How long would it take for this TCP connection to reach its maximum window again after recovering from a packet loss?

Write a new lc-3 trap subroutine (i.e. a subroutine that will be invoked via the trap instruction) that will receive a numeric digit entered at the keyboard (i.e. an ascii character), echo it to the screen, and return in r0 the corresponding numeric value: so if the user types the digit '7', the character '7' will appear on the screen, but the value returned in r0 will be b0000 0000 0000 0111 (#7) you may not use any trap calls in your code - you must implement the "polling" code that interrogates the keyboard status and data registers. ; getnum_tsr ; a subroutine for obtaining a numeric value ; given ascii numeric digit input to keyboard. ; the numeric digit is echoed to the console (e.g. '7' = b0000 0000 0011 0111), ; but the value returned in r0 is the actual numeric value ; corresponding to the digit (e.g. b0000 0000 0000 0111 =