Problem Statement  Consider yourself driving with 60 miles/hour in a city that has only grid like streets, and your GPS is broken.   The specifications of the problem are:      With (x, y) as the coordinates of the car, consider the initial position (0,0).     At each intersection, the only directions available are North, South, East or West     The GPS is broken, and it chooses the direction randomly at each intersection, which happens every 5 minutes     The assumption is that the car has the same speed at all times, including when it changes direction and turns.   Write a program that calculates the distance from the initial point to the location point of the driver after one hour of driving.  Directions      Consider the problem, design an algorithm (or algorithms) that would solve the problem, and then implement the algorithm in Java.     Please insert the algorithm written in pseudocode as a comment in the beginning of your program.     Submit the source code, along with snapshots of your running program - you can take snapshots using PrintScreen, making sure that the console window in which you run the program appears on the screen.     Copy the snapshot in a word processing program of your choosing. If your program has different outcomes, take snapshots of each variation.     Upload your screenshots in Blackboard using the Assignment Upload area below.  Grading  This assignment is graded and required and worth up to 12 points. It will be graded according to the following rubric: Task 	Points Working solution for the problem 	10 Overall usage of programming best practices 	2