You will create an algorithm to determine the winner of each game in the NCAA men's basketball bracket (at least for the east and west regions). Your code does not necessarily need to determine the winner of the entire tournament, but simply work on a game by game basis. Basically, the user should be able to enter the two teams and the code will use the provided lists to determine the winner.Your code should:involve an algorithm that determines a winner between two teamshave a way to determine the winner of a tieuse the given data (at least 2 pieces of data per team)ask for the next match-up after determining a winner (or if you are done)reject any typos or names not in the tournamentinclude commentscreate a new list:it will store the number of wins for each team (Hint this can be done very quickly and easily with a loop.)this list should be mutable and change as you enter match-upsthis list will print once you are done entering match-upsYOU DO NOT HAVE TO KNOW ANYTHING ABOUT BASKETBALL TO DO THIS!! For those of you who are college basketball fans, you should know about bracketology and your algorithm will probably be more precise. If you have no idea about basketball or sports in general, ITS OK! You should know that when two people compete, there is a winner. You will simply pick some data to use in an algorithm to determine a winner. I am not grading this on accuracy to the real games.

An eight-team single-elimination tournament is set up as follows: For example,eight students (called A,B,...,H) set up a tournament among themselves. The top-listed2student in each bracket calls heads or tails when his or her opponent flips a coin. If the callis correct, the student moves on to the next bracket.(a) How many coin flips are required to determine the tournament winner?(b) What is the probability that you can predict all of the winners?(c) In NCAA Division I basketball, 64 teams participate in a single-elimination tourna-ment to determine the national champion. How many games are required to determine thenational champion?(d) Assume that for any given game, either team has an equal chance of winning (thatis probably not true). On page 43 of the March 22, 1999, issue, Time claimed that the“mathematical odds of predicting all 63 NCAA games correctly is 1 in 75 million.” Do youagree with this statement? If not, why not?

Two evenly matched basketball teams (call them A and B) compete in a best-of 7 championships (the first team to win 4 games wins the championship). Once the champion has been determined, no more games are played. In each game, there is a home team and an away team. The home team wins the game with probability p ≥ 1/2, independent of all previous games. Suppose that the first three games will be held at the home of team A and the last 4 (or fewer if they are not needed) are played at the home of team B.(a) Let X be the number of games won by team A out of the first 3 games. Specify the distribution of X.(b) Find the probability that only 4 games are played.(c) Which of the two teams is more likely to win the trophy? Explain why.(d) Give an expression for the probability that team A wins the trophy, and evaluate it when p = 0.55.(e) Let Y be the number of games won by team A. Find the probability mass function for Y.(f) Evaluate the expected number of games won by team A and the expected number of games played when p = 1/2.(g) Observe (via computations or simulation) that when p = 0.55 the expected number of games won by team A is larger than that of team B, even though team B is more likely to win the trophy.

In a tournament, a team has played 40 matches so far and won 30%30% of them. If they win 60%60% of the remaining matches, their overall win percentage will be 50%50%. Suppose they win 90%90% of the remaining matches, then the total number of matches won by the team in the tournament will be.

There are 2 teams, each having N players. There will be N rounds played between the 2 teams. In every round, a player from team A plays against a player from team B. The more powerful player wins the game. Given the strength of the players of both teams, you have to find the maximum number of rounds team A can win. Note that a player cannot play more than 1 round.Input FormatThe first line of input contains T - the number of test cases. It's followed by 3T lines. The first line contains the N - the size of the team. The next 2 lines contain N numbers each - the strength of the players of team A and team B respectively.Output FormatFor each test case, print the maximum number of rounds team A can win, separated by a new line.Constraints1 <= T <= 5001 <= N <= 100000 <= A[i], B[i] <= 10000ExampleInput341 5 7 4 3 8 2 10 22 3 10 5 33 7 10 5 20 15 Output201ExplanationTest-Case 1Player with strength 5 in team A can defeat player with strength 3 in team B.Player with strength 7 in team A can defeat player with strength 2 in team B.Test-Case 2No Player in team A can defeat any player in team B.Test-Case 3Player with strength 7 in team A can defeat player with strength 5 in team B.

Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given scores. Store them in a list and find the score of the runner-up.Input FormatThe first line contains . The second line contains an array of integers each separated by a space.