Input: you are given a spreadsheet where each row corresponds to a direct flight between a pair of airports. for example, (source airport: a departure at 8 am, destination airport: b estimated arrival 10:30 am). task: given a source s and a target airport t, our goal is to find a connected flight path that starts at s at 1 pm and arrives at t as early as possible. we must also ensure that the arrival at t is no later than 11 pm and the total layover does not exceed 4 hours. if no such path exists print ‘null’ example: input (s-1pm to a-3pm), (s-2pm to c-4pm), (a-4pm to b-7pm), (b-9pm to t-10pm), (c-8pm to t-9pm). output is s -> a -> b -> t . note that this path has a layover of 4 hours and the arrival time is 10 pm. the other path s -> c -> t is infeasible even with an earlier arrival time because its layover is 5 hours. give an efficient algorithm (to the best of your knowledge)
