Consider the computation specified by the following Synchronous Data Flow (SDF) model consisting of four processes P1,P2,P3,P4 and five channels a,b,c,d,e. 2 P1 P2 2 4 2 4 4 P4 P3 2 1) Determine the relative execution rates of the four processes. 2) 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. Consider the computation specified by the following Synchronous Data Flow (SDF) model consisting of four processes P1,P2,P3,P4 and five channels a,b,c,d,e. 2 P1 P2 2 4 2 4 4 P4 P3 2 1) Determine the relative execution rates of the four processes. 2) 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