Four stations, labelled 00, 01, 10, 11, share a common channel. Some subset of the stations has a packet to transmit. The stations execute the basic tree algorithm using the bits in their labels to decide about when to transmit (i.e. instead of the j^th coin flip, each station looks at the j^th bit of its label). Let R_k denotes the mean number of slots needed for this algorithm to complete given that k of the four stations (chosen uniformly, at random) have a packet to transmit. Include the first slot in your count, so that R_0 = R_1 = 1. Compare to the mean time if instead the decisions in the basic tree algorithm are made on the basis of independent fair coin flips (i.e., L_k derived in class). Four stations, labelled 00, 01, 10, 11, share a common channel. Some subset of the stations has a packet to transmit. The stations execute the basic tree algorithm using the bits in their labels to decide about when to transmit (i.e. instead of the j^th coin flip, each station looks at the j^th bit of its label). Let R_k denotes the mean number of slots needed for this algorithm to complete given that k of the four stations (chosen uniformly, at random) have a packet to transmit. Include the first slot in your count, so that R_0 = R_1 = 1. Compare to the mean time if instead the decisions in the basic tree algorithm are made on the basis of independent fair coin flips (i.e., L_k derived in class)