Consider the following network. Assume that each node initially knows the costs to each of its neighbors. Consider the distance$-$vector algorithm.

A$.[2$ points$]$ Suppose that all nodes send the first distance vector updates at the same time. List the distance vectors received by node A from the first updates.

B$.[2$ points$]$ Use the Bellman$-$Ford Equation to calculate the distance vector of node A after receiving the first updates. Note that the question does not ask for the final distance vector of $A.$