1. Solve the following process scheduling using the rate Monotonic Scheduling Algorithm. Then, check whether the tasks are RM schedulable? Upper Bound = U1= U2= U3= U4= U= Then > the tasks ) RM schedulable. 2. Draw the timing diagram for the following process scheduling using the Earliest Deadline First Algorithm. Then