1. Basics of Scheduling Scheduling policies can be easily depicted with some graphs. For example, let's say we run job A for 10 time units, and then run job B for 10 time units. Our graph of this policy might look like this: CPU IAAAAAAAAAABBBBBBBBBB 10 20 In this question, you'll show your understanding of scheduling by drawing a few of these pictures. (1)Draw a picture of Shortest Job First (SJF) scheduling with three jobs, A, B, and C with run times of 5, 10, and 15 time units, respectively. The three jobs arrive at the same time and ignore the context switch overhead. Make sure to LABEL the x-axis appropriately (a) What is turnaround time for A, B and C, respectively? What is the average turnaround for job A, B and C? List the calculation process. (b) What is the response time for A, B and C, respectively. What is the average Response time for job A, B and C? List the calculation process. (2) Draw a picture of Shortest To Completion First (STCF) scheduling with three jobs, A, B, and C, with run times of 5, 10, and 15 time units, respectively. Job A arrives at the time T = 8, lob B arrives at time T = 4, and Job C arrives at time T = 0. Ignore the context switch overhead. Make sure to LABEL the x-axis appropriately. (Note: a job's CPU can be taken away by another job in STCF)