I. Consider the following order$-$requirement digraph which represents a job: preparing a restaurant entr$$e by executing eight inter$-$related tasks. In the graph, vertices represent the tasks and are labeled Ti$-$Ts$.$ For each of these tasks, the time in minutes required for a member of the kitchen staff to perform the task is given within the vertex. A directed edge between two vertices indicates that the task where the edge starts must be finished before the task where the edge ends can begin. Assume that tasks, once started, are not interrupted. $568591.$ List all left$-$to$-$right paths contained in the digraph $($i$.$e$.,$ restrict your list to those that start with Ti or T$2$ and end with T$7$ or Ts$).$ How many such paths are there? $2.$ Which is this jobs critical path? $3.$ What is the length of this jobs critical path? $4.$ If only one member of the kitchen staff is available to prepare the entr$$e$,$ how long will it take? $5.$ If only one member of the kitchen staff is available to prepare the entr$$e$,$ and ifT is started at $6.$ If only one member of the kitchen staff is available to prepare the entr$$e$,$ and if T is started at $7.$ If two members of the kitchen staff are available to prepare the entr$$e$,$ what is the least amount $8.$ If three members of the kitchen staff are available to prepare the entr$$e$,$ what is the least amount $9.$ If two members of the kitchen staff are available to prepare the entr$$e$,$ and if T$,$ and T$2$ are $6$:$30$ pm$,$ whats the earliest time that T$3$ can be started? $6$:$30$ pm$,$ whats the earliest time that T$4$ can be started? of time it could possibly take? of time it could possibly take? started at $6$:$30$ pm$,$ whats the earliest time that Ts can be started?