Question 3. Consider a version of slotted ALOHA protocol where each node with even ID i gets time slot i (note that i is even such as 2, 4, 6, so on) to transmit on the channel, while all nodes with odd ID contend in odd time slots. A node with odd ID transmits (or gets the channel) in an odd slot with probability p. Consider the node IDs are 1, 2, 3, 4, . so on. Similarly, the time slots are numbered as 1, 2, 3, 4, so on. Thus, node 2 gets slot 2, node 4 gets slot 4, node 6 gets slot 6. so on, but nodes 1, 3, 5, 7,. all can contend in odd slots to get the channel. Derive maximum efficiency (i.e., fraction of time slots where channel is occupied) for this protocol. You must show all steps of derivation. For simplicity you can assume an even number of nodes in the network (although this assumption does not change the result).