The flow in a downtown restaurant is measured in parties, where a party is a group of people that will use a single table. The restaurant has ten tables and waiting space for five parties. On a rainy evening, the arrival rate to the restaurant is 10 parties per hour. Once seated, the average time for a party to complete the ordering and eating process is one hour. The time between arrivals has an exponential distribution. Although the service process is not exponential we make the Poisson assumption for analysis purposes. When an arriving party finds the waiting spaces full, it does not stay. Rather it rushes off to a neighboring fast food restaurant that has no limit to service. Part of the analysis for this system appears below. Fill in the empty cells. Times are in hours.

If the restaurant adds another waiting space (to make 6 in all), how will the “Prob. All Servers Busy” change? (up, down, or stay the same) Justify your conclusion.