Please be sure to anser the question:

1) give a factor 1/2 approximation algorithm and prove the computational time.

Wn) 1 with T(1) T(2) T (3) 1 result that the result So, graph set of m E so directed cycle. is acyclic. graph does not have any the right The left graph below has a directed cycle, but the right graph is Give a factor approximation algorithm for this problem Hint: forward-going and the back-going Arbitrarily number of the vertices and pick bigger of the two sets, the edges. Give and prove the computational time the ratio. and approximation