Question: Apply modified Dijkstras algorithm to the following network to find the shortest path between node A as a source and node D as a destination according to the given future contacts starting from (time=0 ) as the current time:

.Dijkstra with time-varying costs L(B)=5 CAB (5,7).(13,16),(20,22) BD-(9,4),(11,15),(26,28).. L(A)-0 7,7),14,15),(26,30).. A(9,10) (14,17).(25,26). CCD-(6,8), 4,10),(23,25 L(C)-9