Sure, here is the translation of task $2$ into English:

### Task $2$

$2.$ Build the marked dependency graph between the sequential expressions and modify them to remove some of these dependencies.

$**$Expressions:$**$

$1.\backslash ($ E$1$: Y :$=$ P $+$ Q $\backslash )$

$2.\backslash ($ E$2$: X $>$ P$,$ E$3,$ E$4\backslash )$

$3.\backslash ($ E$3$: A :$=$ X $-$ Y$,$ E$5\backslash )$

$4.\backslash ($ E$4$: C :$=$ Y $-2\backslash )$

$5.\backslash ($ E$5$: W :$=$ Y $*$ Q $\backslash )$

I want detailed solution