You are given a bag of coins with varying biases. the probability of heads is a random variable sample from uniform distribution u[0,1].you draw a coin from these bag and toss it 100 times what is the probability of getting 100 heads stackover flow

Step-by-step explanation:

Suppose I have a bag of n biased coins, and I sample without replacement m<n of them, and measure each coin i for their parameter pi∈[0,1], that is each coin is Bernoulli(pi). Now I would like to ask what is the most likely pm+1 on the next coin I pick. I am not sure how to answer this question aside from taking the mean of all m coins' parameter so far. That is: p^m+1=p1+…+pmm.

number one is the correct answer

step-by-step explanation: dogs and cats are mentioned, no other animals