Explain distance vector routing with example.

Distance Vector Routing is a dynamic routing algorithm where each router maintains a routing table (distance vector) that contains: - The destination network/node - The distance (cost/hop count) to reach that destination - The direction (vector) i.e., the next hop (outgoing interface) to reach th...