acyclic and disjoint union
You can solve the first part by providing a valid topological ordering of the vertices, which shows that the graph is a DAG. To show that the union is equal to $E$ show that each arc in $E$ belongs to one of the two sets
The second part needs more context, what is OPT here?