16 stations numbered 1 through 16 are contending for the use of a shared channel by using the adaptive tree walk protocol. if stations 2, 6, 8, 11, and 15 suddenly become read at once, how many bit slots(rounds) are needed to resolve the contention?

a) 10

b) 5

c) 7

d) 9