Find the least$-$cost$-$path tree from which Router W is sourced from the network graph of the Network Layer: Control material and the forwarding table at W$.$ The process of obtaining it should describe the step$-$by$-$step process in which the Dijkstra algorithm operates, just like the lecture material.