$3)(20$ points$)$ Consider the transmission of segments of size $\backslash ($ L$=1500\backslash )$ Bytes over a single link of transmission rate $\backslash ($ R$=10\backslash$mathrm$\{$Gbps$\}\backslash )$ from host A to host B$.$ Suppose a pipelined reliable transport protocol is used. The round trip propagation delay from host A to host B and back to host A is $\backslash ($ R T T$=30\backslash$mathrm$\{$msec$\}\backslash ).$ Suppose no segment or acknowledgement is lost or corrupted. Ignore processing delays and suppose that the acknowledgement is very small.

$($a$)$ Suppose the window size is one, i$.$e$.,$ only one unacknowledged segment is allowed to be out in the network at any point in time. How large is the utilization achieved on the link? How large is the throughput $($in bit$/$sec$)$ achieved over the link?

$($b$)$ We want to achieve an average link utilization of at least $\backslash (90\backslash \%\backslash ).$ What is the required minimum size of the window in number of segments? give me a step by solution and exact right ans