I need to calculate the number of trials per round (11 total rounds) it takes for player 2, or player 1 to roll to die that add up to the corresponding round. For example, if it is round three, the player must roll a 2 and a 1. I need to find how many trials/rolls it takes per round to get the specific value to graph on a bar graph. How can I incorporate in my code something to track how many rolls/trials per round. Thank you. I provided my code below aswell.

Use java.  Random rand = new Random(), for loop, for nested loop Run 5 simulations of 10 districts  The requirements is on the image 1 See image2 for the expected output.For the results: suppose that left represents our candidate, and right represent the opponent candidates. The number is equals to the total vote received in 10 districts

In Python write out the Python Code for the following in Jupiter Lab. Show code and outputs. Use a data set and build 3 different pivot tables that each have a least a different index row or column. (You cannot build 2 pivot tables that have the same index rows and columns but aggregate differently. You also cannot simply flip the index rows and columns.) For each pivot table, build a graph.

Let's revisit our first problem, where we want to set up a series of chess matches so we can rank six players in our class. As we did before, we will assume that everyone keeps their chess rating a private secret; however, when two players have a chess match, the person with the higher rating wins 100% of the time. But this time, we are only interested in identifying the BEST of these six players and the WORST of these six players. (We don't care about the relative ordering or ranking of the middle four players.) Your goal is to devise a comparison-based algorithm that is guaranteed to identify the player with the highest rating and the player with the lowest rating. Because you are very strong at Algorithm Design, you know how to do this in the most efficient way. Here are five statements. A. There exists an algorithm to solve this problem using 6 matches, but there does not exist an algorithm using only 5 matches. B. There exists an algorithm to solve this problem using 7 matches,…