(Last Revision 11/11/97)
(11/11/97 -- changed requirements slightly to conform to how
             robots will be spawned.)

DUE Monday, December 8

Robot Problem -- Phase 3

For this assignment, you must write a program that solves the
robot problem described in "RobotAsg-phase-02", but with the
following additional property:

BOUNDED WAITING:

There must exist a bounding function B = f(N) such that

1. If R is a robot that has been spawned and instructed to pass
through the hallway, then other robots will be allowed to enter
the hallway no more than f(N) times after R makes its request to
enter, and before that request is granted.

2. The function f must be a polynomial.  For example f(N)=N^^2+ 1
(N-squared plus one) would be allowable.  (Incidentally, it's
possible to write the program so that f(N) is O(N).)

Here, N represents the number of robots that are vying to enter
the hallway at the time t that R makes its request to enter.
In other words, N is the number of robots currently running at
time t, minus the number of robots that are in the hallway at
time t.