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 direct distance from the initial point to the location point of the driver after one hour of driving (i. e. the distance between two points).