But for how long? Let's take it from the top!
Be ready to allocate upwards of 16.7KB of memory for this task, you eager beavers you.
It is hinted
from the words "busy" and "beaver" that the image is a depiction of a Turing machine (a busy beaver is a halting 2-symbol Turing machine printing the most ones). The markings on the ends of the edges denote various aspects of the transition (no flipping!)
Number the states 0 to 5 starting from the top and going clockwise. The transitions are given below in (old state, old symbol, new symbol, movement direction, new state) format:
(0,0,1,L,1)
(0,1,1,L,0)
(1,0,1,R,2)
(1,1,1,R,1)
(2,0,0,R,5)
(2,1,1,R,3)
(3,0,1,L,0)
(3,1,0,R,4)
(4,0,0,L,0)
(4,1,1,R,2)
(5,0,1,L,4)
(5,1,halt)
We start at state 0 ("take it from the top").
Now
when implemented in C++ the above Turing machine halts after 13,122,572,796 steps, which is how long they'll be kept busy for. 204,918 positions are used, of which 136,610 are ones.