1. It's game-day at The Coliseum for the annual UCLA vs. USC rivalry football game. There are long lines as fans try to get in to cheer on their team. As you stand in line, you wonder if there is a more efficient way to move all of these people from outside to inside the stadium. Currently, you see 10 gates going in the East Entrance. On average, gate agents take 35 seconds to process a customer through the gate by scanning a QR Code. This processing time is exponentially distributed. Each gate has one gate agent, and each agent has his/her own line. You estimate that, on average, 50 fans arrive to the East Entrance (all 10 gates) every 3 minutes. The arrivals are exponentially distributed. a) (2 points) What is the interarrival rate to just one of the gates each hour (you can assume the fans are evenly distributed across all gates at the East Entrance)? 100/hr b) (4 points) When looking at just one gate, how long (in minutes) do customers wait before arriving to the gate agent? 20.42min c) (2 points) How many fans, on average, are waiting to be serviced at one gate? 34.03 fans d) (4 points) With one line per gate agent, when you look at all gates at the East Entrance, what is the average wait time for a typical fan at the East Entrance? How many fans are waiting to get to any agent at the East Entrance? 20.42 min; 340.28 fans Based on your BUAD 311 skills, you are convinced the fan experience would be better if you had one long, serpentine line supported by all gate agents (instead of a line for each agent). You would like to propose this change to The Coliseum Operations Manager, but you need to bring numbers to justify this proposal. e) (5 points) What is the new wait time in minutes if you have one long, serpentine line that is serviced by all gate agents? 1.89min