For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?

For any two different vertices u and v of an Acyclic Directed Graph i

1.	For any two different vertices u and v of an Acyclic Directed Graph if v is reachable from u, u is also reachable from v?
A.	True
B.	False
Answer» C.