For concreteness, assume there are n processes and also n servers, where n is some positive integer. the sample space is all n n possible ways of assigning the processes to the servers, with n choices for each of the n processes. by the definition of our lazy algorithm, each of these n n outcomes is equally likely. now that we have a sample space, we’re in a position to define random variables. one interesting quantity is server load, so let’s define y as the random variable equal to the number of processes that get assigned to the first server. (the story is the same for all the servers by symmetry, so we may as well focus on the first one.) what is the expectation of y ? formally prove your answer.