Consider the following scenario: Router $"$a$"$ has only two directly attached neighbouring Routers $"$b$"$ and $"$c$".$ The cost to connect Router $"$a$"$ and $"$b$"$ is $3,"$a$"$ to $"$c$"$ cost is $6$ and $"$b$"$ to $"$c$"$ cost is $2.$ Router $"$b$"$ has a minimum cost path to another Router $"$d$"$ and the cost is $5.$ Router $"$c$"$ also has a minimum cost path to Router $"$d$"$ and the cost id $8.$

Based on Distance$-$Vector $($DV$)$ algorithm, what is the Router $"$a$"\text{'}$s distance vector for destination b$,$ c$,$ and d$?$

Question options:

Da$($b$)=3,$ Da$($c$)=5,$ Da$($d$)=8$

Da$($b$)=3,$ Da$($c$)=4,$ Da$($d$)=7$

Da$($b$)=3,$ Da$($c$)=4,$ Da$($d$)=8$

Da$($b$)=3,$ Da$($c$)=5,$ Da$($d$)=5$