Consider the slotted CSMA protocol with no persistence after carrier sensing. The channel is time-slotted with a time slot lasting a propagation delay t. Use the same assumptions we made for the discussion of ALOHA with all nodes having the same propagation delay t from each other. Obtain the throughput of slotted non-persistent CSMA using a three-state Markov chain as we discussed in class for pure ALOHA. The type of transmission period that happens next is defined only by the number of arrivals in the last time slot of the previous transmission period. An example of the operation of slotted CSMA over time is shown in the following figure