java Randomwalkers XXXXXXXXXXaverage number of steps = XXXXXXXXXX-/Desktop/loops> java Randomlalkers XXXXXXXXXXaverage number of steps = XXXXXXXXXX-/Desktop/loops> java Randomlalkers...

Extracted text: (€) 10:08 ••. 4. Random walkers. Write a program RandomWalkers.java that takes two integer command-line arguments r and trials. In each of trials independent experiments, simulate a random walk until the random walker is at Manhattan distance r from the starting point. Print the average number of steps. -/Desktop/loops> java Randomwalkers 5 1000000 average number of steps = 14.98188 -/Desktop/loops> java Randomlalkers 5 1000000 average number of steps = 14.93918 -/Desktop/loops> java Randomlalkers 10 100000 average number of steps = 59.37386 -/Desktop/loops> java Randomlalkers 20 100000 average number of steps = 235.6288 -/Desktop/loops> java Randomwalkers 40 100000 average number of steps = 949.14712 -/Desktop/loops> java Randomwalkers 80 100000 average number of steps = 3775.7152 -/Desktop/loops> java Randomwalkers 160 100000 average number of steps = 15113.61108 As r increases, we expect the random walker to take more and more steps. But how many more steps? Use RandomWalkers.java to formulate a hypothesis as to how the average number of steps grows as a function of r. Estimating an unknown quantity by generating random samples and aggregating the results is an example of Monte Carlo simulation–a powerful computational technique that is used widely in statistical physics, computational finance, and сотрuter graphics.