Consider an instance of P2 with three jobs and two machines. The processing times of the three jobs are independent and identically distributed according to the discrete distribution P(X=0.5)=P(X=1.5)=0.5, where X represents p1,p2, or p3. (a) In the clairvoyant context, Compute the total expected completion time. (b) In a non-clairvoyant context, suppose that we need to follow the advance job-to-machine allocations (i.e., allocating jobs to machines before processing begins). Compute the total expected completion time. (c) In a non-clairvoyant context, suppose that we need to follow a static list policy (i.e., sequencing jobs in a list before processing begins, and allocating each job to the first available machine). Compute the total expected completion time. Consider an instance of P2 with three jobs and two machines. The processing times of the three jobs are independent and identically distributed according to the discrete distribution P(X=0.5)=P(X=1.5)=0.5, where X represents p1,p2, or p3. (a) In the clairvoyant context, Compute the total expected completion time. (b) In a non-clairvoyant context, suppose that we need to follow the advance job-to-machine allocations (i.e., allocating jobs to machines before processing begins). Compute the total expected completion time. (c) In a non-clairvoyant context, suppose that we need to follow a static list policy (i.e., sequencing jobs in a list before processing begins, and allocating each job to the first available machine). Compute the total expected completion time