b) Consider the following network topology (See Figure 3 below): 2 1 1 u 2 z N 3 N 3 2 2 w 3 Figure 3. Network topology diagram Construct the stepwise Dijkstra's table, forward table from u and shortest path tree from u (to any nodes) for the network topology diagram of Figure 3 using the Dijkstra's Algorithm. [12]