Write a sixth game program using the random number generator to generate six integer numbers. Use them to indicate one of six boxes. The program builds a stack of these six boxes. The stack must be built in a proper order. Boxes 1, 2, and 3 are on the bottom and box 4 cannot be placed unless box 1 and 2 are already there. Box 5 cannot be placed unless box 2 and 3 are in place. Box 6 can only be placed if box 4 and 5 are in place. If the random number given is for a box without the proper boxes in place then the pyramid must start over. This process can be seen in the sample output on my website. I used 21 methods. These methods made the class easy to follow. Thirteen of the methods created the thirteen possible output combinations of boxes. The algorithm for this problem requires the following operations to be performed: 1) Pick an implementation of either tracing the boxes as they are created or going directly to a solution. 2) A while loop controls the next three steps. 3) Pick a box 4) Determine if this box can be placed 5) Place a box I used 6 boolean variables each one representing a box. A switch statement called one of 6 methods depending on the random number given for a box. These six methods analyzed the current stack of boxes and determined which one of the 13 box combinations to call.