Suppose you have the following project digraph. (The numbers in parentheses represent hours.)
Consider the following timeline using three processors.
◦ This timeline is not optimal because task F was started after processor 3 was idle for 2 hours.
◦ This timeline is not an optimal schedule because the project can be scheduled with a finishing time of 12 hours.
◦ This timeline is an illegal schedule because task E was started before task C was completed.
◦ This timeline is an optimal schedule for three processors.
◦ none of these