A real$-$time system uses the Total Bandwidth Server to schedule a set of aperiodic tasks together with

periodic tasks.

The periodic task set is composed by $2$ tasks $T1=(2,8)$ and $T2=(3,9),$ where each pair is composed

respectively by the Worst Case Computation Time and the period.

During the execution, four aperiodic tasks are released: $J1=(7,3),J2=(10,2),J3=(25,1),J4=(31,4),$

where each pair is composed respectively by the release time and the Worst Case Computation Time.

You can easily notice that the total workload generated by aperiodic tasks is equal to $10$ time units.

Draw the schedule on a paper, with the starting time of the timeline set equal to $0($zero$).$ Report the $10$

time instants when the aperiodic workload is executed. Write each number in one of the $10$ available

boxes below. The numbers must be inserted in increasing order, from the smallest to the biggest

number, i$.$e$.,$ in the same order as they appear on the timeline.

For example, if an aperiodic task is executed for $2$ consecutive time units starting at time $0,$ as in the

example reported in the figure, you have to indicate two values, in two different boxes, with the

numbers $0$ and $1.$