It is a well-researched fact that men in a restroom generally prefer to maximize their distance from already occupied stalls, by occupying the middle of the longest sequence of unoccupied places. For example, consider the situation where ten stalls are empty. _ _ _ _ _ _ _ _ _ _ The first visitor will occupy a middle position: _ _ _ _ _ X _ _ _ _ The next visitor will be in the middle of the empty area at the left. _ _ X _ _ X _ _ _ _ Write a program that prints out the diagrams in the format given above when the stalls become filled, one at a time. Hint: Use an array of Boolean values to indicate whether a stall is occupied. The code will be written in the Restroom. java file.