PYTHON ONLY

Suppose that people enter an empty room until a pair of people share a birthday. On average, how many people will have to enter before there is a match? Write a program birthday.py that takes an integer trials from the command line and runs trials experiments to estimate this quantity, where each experiment involves sampling individuals until a pair of them share a birthday. Assume birthdays to be uniform random integers from the interval [0, 365). $ python birthday.py 1000 24 # birthday.py: estimates the number people that must be sampled until a # pair of them share a birthday, import random import 3tdarray import stdio import sys DAYS_PER_YEAR = 365 # Get trials from command line/as an int. # Define a variable count denoting the total number of individuals sampled # across the trials number of experiments. # Perform trials number of experiments, where each experiment involves sampling individuals until a pair of them share a birthday, for t in range(...): Setup a ID list birthdays_seen of DAYS_?ER_YEAR booleans, all set to False by default. This list will keep track of the birthdays encountered # in this experiment. # Sample individuals until match, while # Increment count by 1. Define a variable birthday with a random integer from the interval # [0, DAYS_PER_YEAR). If birthday has been encountered, abort this experiment. # Record the fact that we are seeing this birthday for the first time. # Write the average number of people that must be sampled before a match