Problem 1: Consider scheduling three given set of tasks by using the earliest deadline first (EDF), the rate monotonic (RM), and the latest deadline first (LDF) (also known as the least laxity first (LLF)) algorithms. Their repetition periods, computation times, the first invocation times, and deadlines are defined in the table shown below. The tasks are assumed to be preemptive. Show the timing diagram of each task by applying the above three scheduling policies.] Period Computation time First invocation time Deadline 2 0.5 0 2 10 1.8 3 10 Problen 2: Solve the Problem 1 above by using the task specifics provided in the following table. Period Computation time First invocation time Deadline 0.5 4 1.8 0 2 10 Problem 1: Consider scheduling three given set of tasks by using the earliest deadline first (EDF), the rate monotonic (RM), and the latest deadline first (LDF) (also known as the least laxity first (LLF)) algorithms. Their repetition periods, computation times, the first invocation times, and deadlines are defined in the table shown below. The tasks are assumed to be preemptive. Show the timing diagram of each task by applying the above three scheduling policies.] Period Computation time First invocation time Deadline 2 0.5 0 2 10 1.8 3 10 Problen 2: Solve the Problem 1 above by using the task specifics provided in the following table. Period Computation time First invocation time Deadline 0.5 4 1.8 0 2 10