(a)Find the widest paths from C to all other network nodes assuming link state routing. Show the steps in your computation.
Step
N
W(A), p(A)
W(B), p(B)
W(D), p(D)
W(E), p(E)
W(F), p(F)
0
C
1,C
0
3,C
5,C
0
1
C,E
1,C
2,E
5,E
1,E
2
C,E,D
3,D
2,E
2,D
3
C,E,D,A
2, E
2,D
4
C,E,D,A,B
2,D
5
C,E,D,A,B, F
(b)(4 pt.) What is the corresponding spanning tree?
F
D
E
B
C
A
2
1
7
2
2
3
3
5
1
1
F
D
E
B
C
A
2
7
2
3
5
