Suppose your computer (only) has a fair coin that can be flipped for an unbounded number of times. Prove that there does not exist any algorithm that always terminates in a finite number of steps and outputs an element from ,2,3,4,5 uniformly at random, i.e. the algorithm cannot output fail or anything outside the range 1,2,3, 4,5) Hint: Given any positive number k, and an algorithm that tosses k coins, what is the sample space of the outcomes? Use a counting argument to prove the statement