discrete structure

Part II: Graph Modelling

Construct a precedence graph for the following sequential program:

a := x + y; /* Statement s1 */

b := z + 1; /* Statement s2 */

c := a - b; /* Statement s3 */

w := c + 1; /* Statement s4 */

d := a + e; /* Statement s5 */

w := w * d; /* Statement s6 */