Consider the routing protocols given in List-I and the names given in List-II:
List-I
(i) Distance vector routing
(ii) Link state routing
List-II
(a) Bellman-Ford
(b) Dijkstra
For matching of items in List-I with those in List-II, which ONE of the following options is CORRECT?
- A(i) – (a) and (ii) – (b)
- B(i) – (a) and (ii) – (a)
- C(i) – (b) and (ii) – (a)
- D(i) – (b) and (ii) – (b)

