For each roll of the pair of dice, increment ONE element in the array that corresponds to value the dice. For example, i

[answerhappygod]

For Each Roll Of The Pair Of Dice Increment One Element In The Array That Corresponds To Value The Dice For Example I 1 (43.61 KiB) Viewed 24 times

For Each Roll Of The Pair Of Dice Increment One Element In The Array That Corresponds To Value The Dice For Example I 2 (58.18 KiB) Viewed 24 times

For each roll of the pair of dice, increment ONE element in the array that corresponds to value the dice. For example, if d1 rolled a 3 and d2 roled a 6 , then you would increment the array element rollis {2∣[5) (where the first index corresponds to the value of d1 and the second to the value of d?: remember that index values start with zero so we need to shift by one). For example, suppose we roll the dice 7 times as toilows (each roll showing dy​, d2 in that order):
[[0,0,0,1,0,0], [0,1,1,0,0,1], [0,0,0,0,0,0], [0,0,0,0,0,0], [0,0,0,0,0,0], [0,1,0,0,0,2]] Notice that the last two rolls each affect a different element in ro li ts even though the total af both are the same. Your method will return this rolls array after the dice are rolled a total of n times. Next, add a method public static void diceRollResults(int]l] rolls) that takes a 2-d array of integers (as output by the method above) and prints the following to the terminal (standard output): 1. The input array (you can tise Arrays. deeptostringl i to he pl 2. The number af dice folls for the input array fyou need to compute this) 3. The distribution of the combined totals for the rol's. Each time the dice are roled, their values sum to one of 2,3,…,12, You are asked to find the fraction of rols that result in 2 , and 3 , and 4 , etc. fit is here that the total of the d1 and d? are used.) The expected distribution of the total values (f each die is fair) is given at the end of this question. You can also see the distribution here. Run your methods several times with different values of n. In particular, use n−36,n−360, and n−36000. For now, use ary value for the input seed for this. (The value is not actualy used in the method yet.) Note: in practice, pseudorandom numbers are usually good enough. Obtaining truly random numbers is expensive (in time and effort). We obtain truly random numbers by observing nature: measuring radioactive decay, observing microscopic temperature fluctuations of the cpu or other various electromagnetic/quantum phenomena. It is not always possible to generate enough truly randcm numbers for our needs. Only some applications require truly random numbers though (ike securing internet connections). Distribution of fair cice rolls