Given the SDF model below:

a$.$ Derive an offline schedule where $A$ is always executed before $B,$ and $B$ is always

executed before $C.$

b$.$ Derive the initial buffer conditions required for the schedule in part $($a$).$

c$.$ Derive the minimum buffer sizes required for each edge of the SDF for the schedule

in part $($a$).$