$2.$ Show the simulation graph on a vertical time axis $($like in slides, with events labeled with the senders number A$-$E$)$ the contention period of five equally distanced Ethernet stations that all attempt to transmit at T$=0$ a minimally sized frame, in the style of the binary Exponential Backoff Algorithm. Assume that time is measured in slot times, and that exactly one slot time is needed to detect a collision $($so that if two stations transmit at T$=1$ and collide, and one of them chooses a backoff time k$=0,$ then that station will transmit again at T$=2).$

Use coin flips or some other source of randomness as follows: write your student ID in binary $->$e$.$g$.,1001010101010010110010100101011.$

use the bits in order from the least significant to the most significant. If for a given coin throw you need k bits, use the least significant student ID bit extracted

in the corresponding group of bits, as the least significant bit of the coin thrown.

For example, with the above ID$,$ if we need a number between $0-7$ and then another between $0-15,$ the first will be $011=3,$ and the second will be $0101=5$

Also run one simulation with the random sequence R: $10010101010100101100101001010111001010101010010110010100101011$

T$0$: x x x x x

T$1$: $1.1.0$x$.1.0$x

T$2$: $1$x$.1$x$.011$x$.10$

T$3$: $10.00$x$.$ x $11.10$

T$4$: $10.100.010.11.$ T

T$5$: T$.100.010.11.\_$

T$6$: $\_.100.$ x$.$ x$.\_$

T$7$: $\_100.1010010\_$

T$8.\_.$ T$.1010.010\_$

T$9.\_.\_1010.$ T $\_$

T$10.\_.\_1010.\_\_$

$...$

T$17\_\_$ T $\_\_$