apply the adaptive tree walk protocol proposed by Capetanakis(1979) and improve by Bertsekas and Gallager(1992) to be slotted ALOHA network of 16 station A,B... and P contending for the use of a shared channel. Suppose 4 station G,M,K,L transmit at the beginning slot of a contention resolution period and result in a collision at time slot t=1.

(a),Which time slots, t, will station G,M,K,L each transmit a frame successfully later on?

(b),How many bit slots are totally needed to completely resolve this contention event?