PROBLEM STATEMENT

Background:
DIS.com needs to ship boxes to consumers but is too cheap to hire more
than one worker. A random amount of boxes (between 1 and 3, inclusive)
spews forth from a chute into a bin with no boxes initially
inside. The lonely worker must take boxes out of this bin and place
them in a truck for shipping. Because of sporadic back pains, the
worker will take a random amount of boxes (between 1 and 3, inclusive)
out of the bin. Unfortunately, the bin may hold a maximum of 7
boxes. To prevent the bin from filling up and shutting down the whole
operation, the worker must keep working. Although the worker starts
completely refreshed, all this work tires the worker. So, every four
trips between the bin and truck the worker's efficiency drops by 25%
of the previous value. Eventually the worker will cease carrying
enough boxes, and thus, the bin will fill up.

Algorithm:
You will simulate this problem with a program that has this algorithm: 
+ Set up initial values.
+ Attempt to add boxes to bin.
+ If the bin is not full:
  - remove boxes that the worker is able to extract.
  - obtain more boxes from the chute.
  - repeat.
+ Otherwise, stop the simulation and report the results.

Possible objects that require classes:

Chute, Bin, Worker, Truck, Box


Driver class should be which class?

Main Class