Assume a tcp sender is continuously sending 1,230-byte segment. if a tcp receiver advertises a window size of 7,682 bytes, and with a link transmission rate 41 mbps an end-to-end propagation delay of 14.3 ms, what is the utilization? assume no errors, no processing or queueing delay, and acks transmit instantly. also assume the sender will not transmit a non-full segment. give answer in percentages, rounded to one decimal place, without units (e. g. for an answer of 10.43% you would enter "10.4" without the quotes).

Ihave buncha points. does anyone want any?

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.

How do you make a lenny face? plz, brailiest to who can answer first.