you have to show both algorithm and flowchart

you can just do the flow chart

1 Introduction Consider a perfectly square, infinite grid. Define the driving distance between two points with integer coordinates on the grid as the shortest path between the points when traveling along the gridlines. 2 Objective The goal of this activity is to develop an algorithm that computes the driving distance between two points with integer coordinates. Your solution will be expressed in the form of a flowchart along with a written description of how your algorithm works. 3 Example For points p = (3,1) and p2 = (0,3), the driving distance is 5. 4 Additional Notes 1. The inputs for the algorithm will be two pairs of coordinates (x1, y) and (22,y2). You can assume that they are provided as a list of 4 variables in whatever order you like. 2. Your algorithm may only make use of the basic operators we have discussed in class. You cannot assume that you have the absolute value function. 3. There are no 'one-way streets' in our grid. You can travel in either direction along any gridline. 4. Consider coming up with multiple examples to test your algorithm