Draw a timeline protocol diagram for an $802\mathrm{.}11$ network operating in DCF mode, for a scenario with nodes A$,$ B$,$ C$,$ and D where:

A is reachable from $B$

C is reachable from B$,$ but not from $A$

D is reachable from C$,$ but not from B

all links are symmetric $($i$.$e$.$ if $x$ is reachable from $Y,$ then $Y$ is also reachable from $x)$

A sends a frame to B and C would send a frame to D$.$

Explain the role of the RTS $-$ CTS handshake in solving the hidden terminal problem for the $802\mathrm{.}11$ DCF MAC protocol.

Describe in words what happens in your scenario. How is a collision with a DATA frame avoided in your scenario?