Itinerary Generation problem Suppose that you are given a list of all flights, where each flights has a stating time, arriving time, source, destination flight number, airline name. A user tells you the date, the source and destination to travel. The task here is to find a list of all possible itineraries starting on that day. Design an algorithm to compute all possible itineraries starting on that day. An itinerary is a plan containing a sequence of flights, where the waiting time between two consecutive flights is at leaset1 hour and at most 3 hours.