3. There are 100 runners in the Amherst 5k Hot Chocolate race; let's label them by jersey numbers 1 to 100. To simulate this race, make a 1D array consisting of 100 entries with random finishing times that are uniformly distributed between 20 and 30 minutes. Each entry in this array corresponds to the finishing time for each runner, e.g., entry #29 is the finishing time for runner 29. Using only array operations and/or array functions: a. Print the top three finishing times; your output could look something like this: Top three finishing times: 20.2094 21.6666 21.8455 b. Print the top three runners; your output coould look something like this: Top three runners: 62 37 88 [Hint: zyBooks Sec 6.7] c. If 25 minutes is the qualifying time for the Hampshire county 5k race, use logical operators to calculate how many runners qualified for the county race