SDF (20 pts) Given the following SDF graph with nodes A, B and C and edges a, b, c, d, e, f. 3 6 2. a f b e 2 ki 4 2. 3 B 4 6 d a) What values of kl and k2 allow an offline schedule (like we did in class)? b) Provide a sample offline schedule such that A precedes B, which in turn precedes C. c) In SDF graphs, cach edge is associated with a buer. For your schedule in b), give the minimum size of each buffer. SDF (20 pts) Given the following SDF graph with nodes A, B and C and edges a, b, c, d, e, f. 3 6 2. a f b e 2 ki 4 2. 3 B 4 6 d a) What values of kl and k2 allow an offline schedule (like we did in class)? b) Provide a sample offline schedule such that A precedes B, which in turn precedes C. c) In SDF graphs, cach edge is associated with a buer. For your schedule in b), give the minimum size of each buffer