b) Consider the following network topology (Fig.3): a 2 4 1 2 C 4 4 4 7 d Fig. 3 Network topology 3 (f Construct the stepwise Dijkstra's table, forward table and shortest path tree from source node a using the Dijkstra's Algorithm. [10]