In the following graph that represents the topology of a network, vertexes represent network routers, and edges represent bidirectional, symmetric communication links and are labeled by the router-to-router cost. With link state routing, please find the paths with the least cost from router A to all other routers, respectively. You need to show each step of your work using the following table. (6) 4,0) The least cost path from A to other routers are: From A to B: AD From A to C: ABDEC From A to D: ABD From A to E: ABDE Prom A to F: A DECP From A to G: ABDECFG