A photo-sharing startup offers the following service. A client may upload any number NV of photos and the server will compare each of the (2 ) pairs of photos with their proprietary image matching algorithms to see if there is any person that is in both pictures. Testing shows that the matching algorithm is the slowest part of the service, taking about 100 milliseconds of CPU time per photo pair. Hence, estimating the number of photos up- loaded by each client is a key part of sizing their data center. The people in charge say that their gut feeling is that N = 10. You (the chief technical officer) say, "but N is a random variable". What will the expected time (in milliseconds) for CPU demand per client be (as a function of N, p or A) if N follows (a) the "distribution" where / is the same fixed number with probability 1? Solution: (b) the Poisson distribution with parameter A? Solution: (c) the geometric distribution with parameter p? Solution: (d) N = 80X +5, where X is a Bernoulli random variable with parameter p? Solution: In each case, include as part of your answer the expected value of N and the variance of N. Make sure your answer is not in the form of a summation for this