initially for this graph all distances are 1 .I am calculating routing table on every node.After that for A ,its neighbour are B and C .At A i am calculating its distance vextor but i am stuck at that point when B-F=infinity,C-F infinity .

So for A how to calculate distance vector in F using B and C routing table .In given answer it is 3?pls someone help