Within your Labs the street and even your La folder write program named BestGP SEver.java that allows the user to enter feet and avenue of a starting and ending corner. The program should then print step-by-step sation from the starting point to the ending point, including the direction and distance traveled and a starting and endinga med Bertopere any turns involved. kain, note that the map provided here shows only the first several streets and avenues. Your program should supp d support any positive odd Input for streets and positive even input for avenues we are two examples of what your completed program might look like when you run it. Underlined parts indicate what you type in as the program is running. Example 1 Starting corner: Street - 1 Avenue - 6 Ending corner: Street - 3 Avenue - 4 Take Avenue 6 east for 1000.0 ft until you get to Street 3. Turn left onto Street 3. Take Street 3 north for 1000.0 ft until you get to Avenue 4. You have arrived at your destination! Example 2 Starting corner: Street - Z Avenue - 2 Ending corner: Street - Z Avenue - 8 Take Street 7 south for 3000.0 ft until you get to Avenue 8. You have arrived at your destination! This assignment likely seems very challenging at first glance, but don't panic! Pretend you're a sloth just chilling in the rain forest, and take it slowly step by step. Here are some hints to get you started: The trip can be broken down into one horizontal component and one vertical component, Start by considering the horizontal component. The distance traveled depends on the numbers of the starting and ending streets. The direction traveled (west or east) depends on whether the number of the starting street is larger than or smaller than the number of the ending street, . Similarly for the vertical component, the distance traveled depends on the numbers of the starting and ending avenues. The direction traveled (north or south) depends on whether the number of starting avenue is larger than or smaller than the number of the ending avenue . If a turn is involved, there are only two possible directions: left or right. What combinations of horizontal and vertical directions produce each kind of turn? There are a few situations in which no turn is needed: a horizontal-only trip, a vertical-only trip. or a case where the starting and ending points are the same in that case, you're already at your destination). Your program should handle all of thesel Within your Labs the street and even your La folder write program named BestGP SEver.java that allows the user to enter feet and avenue of a starting and ending corner. The program should then print step-by-step sation from the starting point to the ending point, including the direction and distance traveled and a starting and endinga med Bertopere any turns involved. kain, note that the map provided here shows only the first several streets and avenues. Your program should supp d support any positive odd Input for streets and positive even input for avenues we are two examples of what your completed program might look like when you run it. Underlined parts indicate what you type in as the program is running. Example 1 Starting corner: Street - 1 Avenue - 6 Ending corner: Street - 3 Avenue - 4 Take Avenue 6 east for 1000.0 ft until you get to Street 3. Turn left onto Street 3. Take Street 3 north for 1000.0 ft until you get to Avenue 4. You have arrived at your destination! Example 2 Starting corner: Street - Z Avenue - 2 Ending corner: Street - Z Avenue - 8 Take Street 7 south for 3000.0 ft until you get to Avenue 8. You have arrived at your destination! This assignment likely seems very challenging at first glance, but don't panic! Pretend you're a sloth just chilling in the rain forest, and take it slowly step by step. Here are some hints to get you started: The trip can be broken down into one horizontal component and one vertical component, Start by considering the horizontal component. The distance traveled depends on the numbers of the starting and ending streets. The direction traveled (west or east) depends on whether the number of the starting street is larger than or smaller than the number of the ending street, . Similarly for the vertical component, the distance traveled depends on the numbers of the starting and ending avenues. The direction traveled (north or south) depends on whether the number of starting avenue is larger than or smaller than the number of the ending avenue . If a turn is involved, there are only two possible directions: left or right. What combinations of horizontal and vertical directions produce each kind of turn? There are a few situations in which no turn is needed: a horizontal-only trip, a vertical-only trip. or a case where the starting and ending points are the same in that case, you're already at your destination). Your program should handle all of thesel
