When people fly long distances, a direct city-to-city flight is often more expensive than taking two flights with a stop in a hub city. Travelers might save even more money by breaking the trip into three flights with two stops. But for the purposes of this challenge, let's assume that no one is willing to stop three times! You have a table with individual airport-to-airport flights, which contains the following columns.

Id - the unique ID of the flight
Origin - the origin city of the current flight
Destination - the destination city of the current flight
Cost - the cost of the current flight.

The cities are all represented by an abbreviation composed of three uppercase English letters. Your task is to write a select statement that lists all the cheapest possible trips that can be done in two or fewer stops. The outputs should have columns origin, destination, stops (indicating the number of stops in current trips) and total_cost. If two trips cost the same but have a different number of stops, include the one with the fewest stops. Sort the output by origin then by destination.