3. It's a Knizia! (No, you don't really need to know this reference.) Your solution to this question must use abstract list functions. Do not use any recursion. In some board games (for example, Ingenius, and Tigris and Euphrates), players earn points in several categories, and their score is determined to be their minimum point value in any category. For example, if a player was gathering points in five categories, and received: 10, 3, 8, 12, 9, their score would be 3 ## A Player is a list of length >-2, where the first entry in Player is of type Str *the remaining entries in Player are of type Nat. . Restrictions: o Do not import any modules other than math and check. Do not use Python constructs from ster modules (e.g cpsl Do not use anyother Python In this question, you will write a function winners, which consumes competitors, a list of Player values. Each Player contains a player's name, ollowed by her point values in a number o functians not discussed in class or explicitly allowed clsewhere. Scc the allowable functians past on Piszza. You are akways allewed to define yaur own helper functions, as larg as they categories. The function winners will determine the highest score among players in competitors, mect the assignmemt and will return the list of names of all players with that highest score. The competitors list is not changed by winners For example, winners ([["A",5,9,6,8,9], # "A" has score 5 # "X" has score 6 # "D" has score 6 # "C" has score 0 # Highest score is 6 Note the following: There will be at least one player in competitors No two players have the same name Each player will have points in the same number of categories, and there will be at least one category of points. Points will always be natural numbers. The names in the returned list should be in the same relative order as in competitors