In a co-op, you develop an algorithm for a content delivery network like Miley.com. Suppose that in a typical minute, you get a k (e.g. a bazillion) content requests, and each needs to be served from one of your n servers. Your algorithm is randomly assign each job to a random server.

A. What is the expected number of jobs per server?

B. What is the probability that a server gets twice the average load? That is, 2 times the expected number of jobs? (A bound is acceptable)

C. What is the probability that a server gets no load? That is, no jobs? (A bound is acceptable)