Assign tasks to cores using First Fit Bin Packing; once assigned, each core will run EDF. As usual, we will assume the relative deadline of a task equals its period. The task set is as follows (as before, each task is defined by a 2-tuple (ei, P:)): T1 = (4,10), T2 = (3,11), T3 = (2,10), T4 = (8, 10), T5 = (4,8), T6 = (3,15), T7 = (3, 21), Tg = (1,100), To = (10,11), T10 = (6,6). Show each step of the allocation process. (4) Repeat Question 3 using Best Fit Bin Packing.This is an algorithm question, BUT this is NOT a programming question
