Graph G is .............. if for any pair u, v of nodes in G there is a path from u to v or path from v to u.

• A. Leterally connected
• B. Widely Connected
• C. Unliterally connected
• D. Literally connected