Construct a precedence graph and write a concurrent program using fork$/$join constructs for the

following statements, S$0$ through S$10$:

S$0$: x $=$ y $=2$; S$1$: z $=$ x $+1$; S$2$: a $=$ y $+2$; S$3$: b $=$ a $+$ z; S$4$: c $=$ b $+5$; S$5$: d $=$ b $3$;

S$6$: p $=$ a $+7$; S$7$: e $=$ c $+$ d; S$8$: q $=$ p; S$9$: r $=$ p $+10$; S$10$: s $=$ q $+$ r $+$ e;