Develop an implementation in pseudo-code, with a syntax similar to C, Python, or Java, that simulates the behaviour of the 1-persistent CSMA/CD protocol over 100Mbps Ethernet. The simulation should support N identical nodes, each wishing to transmit a frame to other nodes at random intervals. Assume that Ethernet employs a fixed slot-time, and that collision detection and resolution takes exactly one slot-time. For this exam question, how can you know if binary exponential back-off is used or not, or is it up to us whether or not we implement it?