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