Consider the following network fragment: A has two attached neighbors, B and C. B and C have a link. In addition, B has a minimum-cost path to destination X (not shown) of 10, and C has a minimum-cost path to X of 8. The complete paths from B and C to X are not shown. All link costs in the network have strictly positive integer values. With the distance-vector algorithm, for a router, a change of its direct link cost or its neighbor's distance vector entry might result in its own distance vector changes. Give A's final distance vector for destination B, C, and X. Give all possible link-cost changes for c(A, B) or c(A, C) (fixing one and changing the other) such that A will inform its neighbor B of a new distance to destination X as a result of executing the distance-vector algorithm