In city street grids, intersections are often defined by two integers, counting the position of horizontal and vertical streets (sometimes called streets and avenues). Imagine traveling from position (h,, vi) to (h2, v2). How many blocks do you traverse? (h,, v.) (h,, v,) Even though there are many possible routes, the distance only depends on the differences h, - h, and v2 - V1. However, you need to take the absolute value because the differences might be negative. Complete the following program that prints the number of blocks traveled, given the origin and destination of the trip (which will change as your code is tested). Distance.java 1 public class Distance 2 { public static void main(String[] args) { // These values will be changed during testing int hl = 3; int vl = 4; int h2 = 4; int v2 = 4; 4 7 9. 10 11 .. 12 codecheck-bjlo-1e-02_06 System.out.print("Distance: "); System.out.println(distance); } 13 14 15 16 }

There is more than one way to calculate the value of T. One way that this can be done is by generating random numbers. This works by recognizing that if you take a unit square that you can draw a quarter circle of unit radius inside the square. The area of the quarter circle is exactly π/4 and the area of the square is 1. So if you randomly generate a pair of uniform numbers between 0 and 1 they will be distributed uniformly across the square. If you count the total number of points generated and the number of points (x, y) where x² + y² = ² < 1 then the ratio of those two numbers will tend towards the ratios of the areas of the square and the circle as the number of points generated increases. The ratio of the areas is just π/4 so if you take that ratio and multiply it by 4 you get an estimate for . a) b Write code to estimate π using this method. You can generate random numbers in the range 0