14. In Self-Test Problem 1 we showed how to use the value of a uniform (0, 1) random variable (commonly called a random number) to obtain the value of a random variable whose mean is equal to the expected number of distinct names on a list. However, its use required that one chooses a random position and then determine the number of times that the name in that position appears on the list. Another approach, which can be more efficient when there is a large amount of name replication, is as follows. As before, start by choosing the random variable X as in Problem 3. Now identify the name in position X, and then go through the list starting at the beginning until that name appears. Let / equal 0 if you encounter that name before getting to position X, and let I equal 1 if your first encounter with the name is at position X. Show that Elmd.