Starvation Consider a network using the Binary Countdown protocol with three stations: 00, 01, and 10. Given that i is the number of the current round, and: Station 00 has a new frame to send every round. 2. Station 01 has a new frame to send iff i mod 2 = 1. 3. Station 10 has a new frame to send iff i mod 2 = 0. If a station is unable to send their frame, the frame is buffered until the next round. Determine which station will send their frame for each of the first nine rounds, starting at i = 0