$1.$ How many distinct priority lists are there for this job?

Where the questions that follow ask for a processor's schedule, enter a list of tasks in the order scheduled, separated by spaces. If idle time follows a task, indicate it as a unit$-$less number. For example, $"$T$35$ T$4$ T$1"$ would indicate that after T$3$ is completed there are $5$ units of idle time on the schedule followed by T$4$ and then T$1.$

$2.$ Find the priority list that would be used in critical$-$path scheduling. List the tasks, separated by commas $($for example, T$1,$ T$2,$ T$3,...).$

$3.$ Apply critical$-$path scheduling to construct a schedule using two processors. List the tasks, including any idle time, on the first processor.

$4.$ List the tasks, including any idle time, on the second processor.

$5.$ How much time does the schedule require? Only enter the number, in minutes.