In the following question, you will compare the performance of gbn, sr and tcp reno (no delayed ack). assume that the timeout values for all three protocols are sufficiently long such that 5 consecutive data segments and their corresponding acks can be received (if not lost in the channel) by the receiving host (host b) and the sending host (host a) respectively. suppose host a sends 5 data segments to host b, and the 2nd segment (sent from a) is lost. in the end, all 5 data segments are correctly received by host b.(a) how many segments has host a sent in total and how many acks has host b sent in total? what
are their sequence number? answer this question for all three protocols.
(b) if the timeout values for all three protocols are much longer than 5 rtt, then which protocol
successfully delivers all five data segments in the shortest time interval?

Write a program called assignment3 (saved in a file assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b. c. it is a simple but very e↵ective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the “larger” integer is replaced by the di↵erence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.

When working with a team you should always do the following, except? question 3 options: be dependable and trustworthy be sensitive to others feelings do your fair share critique members of the group

The option enables you to modify a slide element in most presentation applications.