Explain how a computer can preform this list of tasks as efficiently as possible and determining efficiently if a directed graph has a cycle

10. Your computer needs to run a list of tasks {T, T,.) (you could call them "jobs" or provided are a list L of pairs (i,j) such that task T, needs input from Ti Explain how to determine (as efficient as possible) if we could perform these tasks, and none of the tasks has to wait for an input from another task. It is up to you to determine at which order to perform them 11. Let G(V, E) be an input directed graph. Suggest an algorithm that finds if G contains a cycle. The algorithm should be as efficient as possible