Consider the computation specified by the following Synchronous Data Flow $($SDF$)$ model consisting of four processes P$1,$P$2,$P$3,$P$4$ and five channels a$,$b$,$c$,$d$,$e$.$

Determine the relative execution rates of the four processes.

Schedule the processes according to the rates computed in $1)($there are many possible schedules and you are free to pick any one$).$ Compute the number of initial tokens required on each channel and the queue size of each channel according to your scheduling.