please helps with problem 7 computer networks

7. Consider the following wired, CSMA/CD Ethernet network In this network a signal sent by one host takes exactly 1 time unit to reach the next one to the left or right. So if A begins transmitting at time 0, at time 1 its signal will have reached B. a. 4 pts) Assume that this is the longest length network allowed, and that hosts A and E are placed on the network as far apart as possible. What's the minimum packet transmission time? In other words, how long must A continue transmitting a single packet in order for the network to operate properly? Hin: To solve this problem, you need to consider the worst-case scenario; that A begins transmission at time t, and the instant before the signal reaches E, E starts transmitting, thinking the network is available. The time between when A's packet arrives and when it almost arrives is so small that we will just consider it rounding error, just consider when doing the math that it had indeed arrived at E. Then you need to determine when the evidence of the collision will be known to A b. (10 pts) In the diagram below, draw out this scenario. You won't need all the space 32018 Kevin B Long, Kurose and Ross Page 2 of 5 13 14 15 16 c. (4 pts) At what times does each host detect the collision? d. 4 pts) If the distance bctwcen A & is 300m, how much rcal timc clapscs between our labels 0 and 8? Assume dpnop is 2.5x10* m/s. s (a us is 10*) (4 pts) If the network is 100Mbps, how many bits will be transmitted during that time? c. bits f (4 pts) If A and C attempt to retransmit again immediately, what will happen? g. 4 pts) What does Ethernet do to avoid this problem? Just name the concept, dont describe it in detail please