please answer all the questions with details (questions 10 and 11)

Question 10[32=6%] The table below gives a list of processes along with their burst times. We assume that the processes have arrived in the order P1, P2, P3, P4, P5, all at time 0 . Assuming only one single-core CPU, answer the following: a) Show the schedule using a time scale diagram if we use the First Come First Served (FCFS) scheduling policy. What is the average turnaround and waiting time? b) Repeat (a), this time using Shortest Job First (SJF). Question 11[23=6%] Least-laxity-first (LLF) is a real-time scheduling algorithm for periodic tasks. Slack time, or laxity, is the amount of time between when a task would complete if it started now and its next deadline. This is the size of the available scheduling window. Laxity can be expressed as Laxity =( deadline time )( current time )( processor time needed ) LLF selects the task with the minimum laxity to execute next. If two or more tasks have the same minimum laxity value, they are serviced on a FCFS basis. a. Suppose a task currently has a laxity of t. By how long the scheduler delay may starting this task and still meet its deadline? b. Suppose a task currently has a laxity of 0 . What does this mean