Question $6[20$ Marks$]$

Assume that in a Timer Request Queue the timer queue elements $($TQEs$)$ are maintained in such a way that the time of each TQE is relative to the cumulative time of all the preceding TQEs.

$($a$)$ Show the queue elements after each of the following itimer$(\backslash ($ t $\backslash ))$ requests by named processes, in the given order:

the first one, P$2\backslash (\backslash$rightarrow $\backslash )$ itimer $(5),$ has already been done as an example below tq $\backslash (\backslash$rightarrow $\backslash )$ tqe$[2]\backslash (\backslash$rightarrow $\backslash )$ NULL

$($b$)$ Devise an algorithm for either insertion or deletion of a TQE.