1. Generalized Chain
Propose and discuss a simple generalization of the chain algorithm to minimize memory for the following situations:
(A) Two simple paths without forks, (B) a simple tree where a path forks out into a pair of paths.
(You should use concepts and notation from paper 1 above.)

2. Minimizing Memory Two indipendent paths A and B
Step 1: Use the chain algorithm to partition the paths indipendetntly
Step 2: Schedule the resulting segments greedly: steepest first.
Path A
Source O1 O2
Sink O3
Path B
Source O4 O5
Sink O6