Consider the operation of the

Consider the operation of the reverse path forwarding (RPF) algorithm in Figure 4.45. Using the same topology, find a set of paths from all nodes to the source node A (and indicate these paths in a graph using thicker- shaded lines as in Figure 4.45) such that if these paths were the least-cost paths, then node B would receive a copy of A's broadcast message from nodes A, C, and D under RPF.