6. In this case, the rate of arrivals for each queue will be different than before. We shall assume that a person arriving to checkout will choose one of the five queues randomly. What should be the rate of arrival (lambda) for each one of the five queues? O 990 O 198 O 4455. Now what if we have a different layout. We now have 5 lines, each with one cashier. Each line is of what type? O M/M/1 M/M/5 OM/G/5 M/G/18. For each of the five queues, what is the probability of having at least someone checking out? The value must be a number9. In this new system, what is the expected time people need to wait between the time they join the line and the time they leave the store in minutes? The value must be a number3. What is the expected time people need to wait between the time they join the line and the time they leave the store in minutes? The value must be a number4. What proportion of the time are the cashiers idle? (provide your answer as a number between 0 and 1) The value must be a number7. In this particular case, what is the expected number of people in the whole system (remember that there are five queues in total!) The value must be a number10. Naturally, we would like for people to wait as little as possible to checkout. Which system would you implement then? 5 queues with one cashier One queue with 5 cashiers1. At first, let us assume a system with one single line leading to the five cashiers. What type of queue is this? O M/M/1 O M/M/5 O M/G/1 M/G/52. What is the expected number of people in the system (including people waiting in line and being served)? The value must be a number