Consider the network in Figure$-5.$

In the class, we use the node A as a starting node to simulate the Girvan$-$Newman

example to show the forward and backward step.

Show the simulation of forward and backward step of the Girvan$-$Newman algorithm

using node B$,$ D and G as the starting node. For each graph, you should show

the number of shortest paths from the starting node and $($forward step$)$

the amount of flow from the starting node to all other nodes that use each

edge $($backward step$)$

Please see attached image for clearer question and I kindly request you draw the graph and attach it in the answer please. Thank you!