We made a solution for the exercise 8.27 from the book Probability and Computing, by Upfal and Mitzenmacher. The book talks about queueing theory and we basically created a simulation of 100 M/M/1 queues with Poisson arrivals and exponential service times.