Verify the schedulability under earliest deadline first algorithm and construct the schedule of the following task set: 1 {1, 5, 4}, 2

Verify the schedulability under earliest deadline first algorithm and construct the schedule of the following task set: τ₁ ≡ {1, 5, 4}, τ₂ ≡ {2, 8, 6}, and τ₃ ≡ {1, 4, 3}. Here, the notation τ_i ≡ {e_i , p_i , D_i} gives the execution time, e_i , period, p_i , and relative deadline, D_i , of task τ_i .