= CORUS: +90 (212) 533 6532 E-mall: leom honou.tr KAZALK Congder the following network with the indicated routers and link costs. If we apply Dijkstra's algorithm to find the shortest distance between node A and of the other determine the order that the nodes get included in the visited set? (Thus, in what order are the nodes included in the sinktree The nodes are included in the sink free with the following order A 14 2 12 Mest page