Problem
1. What is the probability of getting exactly k heads on n tosses, where the coin has a probability of p in coming up heads on each toss? What about k or more heads?
2. Suppose that the probability of getting a head on the ith toss of an everchanging coin is f(i). How would you efficiently compute the probability of getting exactly k heads in n tosses?