Describe how the customer arrival and departure event algorithms (Figures 13.4, 13.7) and the main algorithm (Figure 13.8) of our McBurgers simulation would change if we changed the system in each of the following three ways:
a. Instead of a single waiting line, we have $N$ waiting lines, one for each of the $N$ servers in the restaurant. That is, our model now behaves as shown:
b. The waiting line has a maximum length of MAX. If the length of the waiting line is currently less than MAX, then the customer gets into line in exactly the same way as in the current model. However, if the waiting line has a length equal to MAX, then the customer leaves the store without being served.
c. Each customer is assigned a priority when first entering the store (a value from 1 to 10 ), and if there is no server currently available, the customer goes into the waiting line in priority order. That is, a customer gets into line ahead of all people with lower priority and behind everyone with an equal or higher priority.