$1.$ The list$-$processing algorithm requires a priority list to break scheduling ties. How many possible 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.$ Use the list$-$processing algorithm to schedule the job on two processors. Use the following priority list: T$1,$ T$2,$ T$3,$ T$4,$ T$5,$ T$6,$ T$7,$ T$8.$ List the tasks, including any idle time, on the first processor.

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

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

$5.$ Use the list$-$processing algorithm to schedule the job on two processors. Use the following priority list: T$4,$ T$1,$ T$7,$ T$5,$ T$2,$ T$3,$ T$6,$ T$8.$ List the tasks, including any idle time, on the first processor.

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

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