Note: need to show your work including formula, step by step solving the problem to get credit.

Question: Consider the following graph where weights represent the cost of each path between adjacent nodes in a network.

Part A$)$ Apply Dijkstra's algorithm to find the shortest path tree starting from Node $\text{'}$Y$.$ Clearly show each step of the algorithm and your work, including the initialization, iterations, and final result. $(4$ points$)$

Part B$)$ Determine by drawing the shortest paths tree and their respective distances from Node $\text{'}Y\text{'}$ to all other nodes in the graph based on the computed shortest path tree. $(3$ points$)$

Part C$)$ Create a forwarding table for node $\text{'}W\text{'}$ in purpose of forwarding messages to all other nodes. $(3$ points$)$

Your Answer: