7.5 Suppose a set of nodes A-F and switches S1-S6 are connected as shown. The links between switches are labeled with weights, which are used by some routing applications. The weights represent the cost of using that link. You are to find the path through S1-S6 with lowest total cost (that is, with smallest sum of weights), for each of the following transmissions. For example, the lowest-cost path from A to E is AS1S2S5E, for a total cost of 1+2=3; the alternative path AS1S4S5E has total cost 5+1=6. (a). A--F (b). A--D (c). A--C (d). Give the complete forwarding table for S2, where all routes are selected for lowest total cost.

52 5K