Question

Tyson is all prepared for the Beyblade World Championship. The tournament is team-based and each team can have N members. A player can fight against a single player only. Team G-Revolution is all excited and pumped up as they have practised a lot. Kenny, the mind of team G-Revolution, has created a database where he has the data about the power of other teams' members and his own team members. The tournament is going to start in some time and Kenny moves to the cafeteria to have a snack before the competition. The team G-Revolution is to fight in some time and they are tensed up as someone has kidnapped Kenny from the cafeteria. They have made a police complaint and the police are searching for Kenny. Luckily, they have found his device with all the data. The problem is, the data is present randomly and not in the order they have to fight the opponent. Team G-Revolution wants to win at any cost and for that, they need the order in which they have to fight optimally to win the maximum number of battles. A player can win only when his/her beyblade power is strictly greater than the opponents beyblade power. Example: Consider the team size is 3, N = 3 The 3 players of both the teams are shown with their beyblade powers. Team G-Revolution is presented in the order: Tyson, Max, Ray Team All Starz is presented in the order: Michael, Eddy, Steve With the given arrangement, Team G-Revolution would be able to win only 1 fight. Team G-Revolution should be shuffled in an optimal manner as below: The maximum number of fights Team G-Revolution can win is 2 when they are arranged optimally or fight in an optimal order. Team G-Revolution needs help with the device. Tyson has heard about your skills and called you up to help them shuffle their positions in an order such that they would be able to win the maximum number of fights. Can you help Tyson and Team G-Revolution? Can someone plz solve the above problem using powershell​

Answer 1

Answer:all this is nonsense

Explanation:

Answer 2

Answer:

so big question