Suppose that the times between the arrivals of consecutive customers in a certain queueing system are independent random variables uniformly distributed over the interval (0,1). The service time is exponentially distributed, with parameter μ. Finally, the (only) server is able to serve all the customers at once, so that there is no waiting. Calculate the limiting probability that the server is busy.
Indication. Use the results on renewal processes.