48. For the network given in Figure 3.53, show how Dijkstra's shortest-path algorithm builds the routing table for node D. Create a routing database (table) similar to Table 3.14 on page 258. (You may find it more useful to number the steps as listed in the algorithm on page 257.) Illustrate the progression of the algorithm using Radia Perlman's technique as illustrated on slides 7-8 through 7-14. Draw one tree for each pass through the algorithm. Finally, create the resulting routing table (similar to the routing table on slide 7-14). The tree for the first pass is shown below. The tables and trees may be drawn by hand and scanned or photographed for submission to Canvas. (10 points) 3 End of Pass 1* D) Next 6 8 B 1 F 8 A 2 E 2 Neighbor Neighbor D E 2 *Pass refers to Dijkstra's algorithm, as described on text p. 256 Figure 3.53 Network for Exercises 46, 48 and 54