Answer:

Step-by-step explanation:
We can model the string as a hypergeometric distribution, as each bit has two possible values, 1 or 0, and the chance of a 1 or 0 changes with every bit, as there are a finite number M of 0's and N of 1's and every bit takes one of those values.
If M+N (total size of the string) >> r (number of trials), we could model it as a binomial distribution as the probability of a 1 or 0 wouldn't change in a significant amount with every bit, but as we don't know the magnitude of M+N and r, we follow up with hypergeometric distribution.
The distribution has the following formula for probability:

Where k is the number of sucesses, K is how many total sucess states are in the population, N is the population size and n is the number of draws.
For our case, a 1 would be a sucess, i.e. k the number of 1's we want to know the probability, N our total number of 1's, M+N the length of the string (population size) and we want to analyse what happens in the first r bits (number of draws):

Answer:
question 2 is true
question 3 is false
Step-by-step explanation:
4) Answer is D.
Irrational numbers cannot be classified as rational numbers
5) Answer is B.
Every irrational number is a real number
Okay so 300 meters per minute and he ran 8 minutes..
300x8=2400
He still had 600 left to go...
2400+600=3,000
He had to run three times longer than Eric...
3000/3=1000
Does that make sense?
Sent a picture of the solution to the problem (s).