Python program to model the solution of the given problem.

A two-envelopes puzzle. You are handed two envelopes. and you know that each contains a positive integer dollar amount and that the two amounts are different. The values of these two amounts are modeled as constants that are unknown. Without knowing what the amounts are, you select at random one of the two envelopes, and after looking at the amount inside, you may switch envelopes if you wish . A friend claims that the following strategy will increase above 1 /2 your probability of ending up with the envelope with the larger amount: toss a coin repeatedly. let X be equal to 1 /2 plus the number of tosses required to obtain heads for the first time, and switch if the amount in the envelope you selected is less than the value of X . Is your friend correct? Write a python program to model the problem. Run several trials, generating two random amounts to put in the envelope, with the amount to be an integer between 1 and 10, uniformly distributed. Pick one at random, then programmatically flip a coin to model the solution given in the problem. Run the program for 100 trials, 1000, trials 10,000 trials, 100,000 trials, and 1,000,000 trials • The number of times the first choice made is cheaper (We expect half). • The number of times the formula swapped. • The number of times swapping produced the lower value. As the number of trials increases, do the ratios of the three values to the number of trials seem to converge to a value? For proper description see word file.