1. Suppose that you are a software engineer who is working on design of an inflight entertainment system with on-demand movie streaming Users on longer flights like to start each movie right when their previous one ends, but they complain that the plane usually lands before they can see the ending So you need to build a feature for choosing movies whose total runtimes will equal the exact flight length. Your input is a flight duration (in minutes) and a list of movie lengths (in minutes). Your algorithm should return a boolean value indicating whether there is a set of movies such that their total length equals the flight duration. You may assume that users will watch at most three movies during a flight. The algorithm should be as fast as possible. 2. Can a kingdom in which 7 roads lead out of each city and roads intersect only in cities have exactly 270 roads? 3. Can 77 computers be connected by cables in such a way that each computer is connected with exactly 15 others? 4. Is it possible to draw the following figures with one pen stroke without drawing the same line twice? Explain your