We saw in class how to tell if the Mariners can make the playoffs, but what about the Seahawks? An NFL game can end with one team winning and the other team losing, or with the teams tying. If a game ends in a tie, each team gets 1/2 of a win. You will be given a list of teams, with their current number of wins (which will be either an integer, or an integer plus 1/2) along with a list of remaining games to be played. Your goal is to tell whether the Seahawks can finish with more wins than any other team (in class, we allowed for another team to have the same number of wins, in this problem the Seahawks need more to count as winning). For example, if Team A has 1/2 wins, the Seahawks have 1/2 wins, and Teams B and C have 0 wins each, and the remaining games to be played are A vs. B, A vs. C, B vs. C, and B vs. the Seahawks, then it is impossible for the Seahawks to finish the mini-season with more wins than any other team. You should return false. If the current standings are Teams A, B, C, and the Seahawks all have 5 wins and the remaining games are A vs. B and C vs. the Seahawks, the Seahawks can still win (by winning their game, and having A vs. B end in a tie). You should return True (a) Describe how you will solve the problem (in English and/or pseudocode) (b) Briefly explain why your algorithm works. Be sure to mention how it checks for the possibility of ties (our explanation is 3 sentences, depending on your algorithm, you might need more or less explanation). (c) What is the running time of your algorithm? Briefly justify Activate Wine Go to Settings to