Area 0 (Backbone Area) Area 1 10.1.6.0 6 Internal Router Border Rou Backbone Router 10.1.7.0 10.1.8.0 10.1.9.0 Figure 1: the OSPF network in Problem 1. Assume that the link costs are all equal to one and that all interfaces are up. Run Dijkstra's algorithm to calculate the best routes from router 1 to all subnets. Show the contents of the routing table in router 1, after the algorithm completes its calculations. Show details of your calculations (for a topology that simple, you can simply guess the best routes). You can run the calculations by hand or search the web for existing code. Area 0 (Backbone Area) Area 1 10.1.6.0 6 Internal Router Border Rou Backbone Router 10.1.7.0 10.1.8.0 10.1.9.0 Figure 1: the OSPF network in Problem 1. Assume that the link costs are all equal to one and that all interfaces are up. Run Dijkstra's algorithm to calculate the best routes from router 1 to all subnets. Show the contents of the routing table in router 1, after the algorithm completes its calculations. Show details of your calculations (for a topology that simple, you can simply guess the best routes). You can run the calculations by hand or search the web for existing code