Prove Gerasoulis and Yang’s result for the 2-processor scheduling problem (see Figure 9.6).

Note that each communication cost and node cost should be represented by variables l and c, respectively.