Consider reverse path flooding $($RPF$)$ in a network with point$-$to$-$point links $($what we covered

in class$).$ Assume that you also know that your unicast routing is based on distance vector

routing $($basic distance vector routing without split horizon$/$poisoned reverse$).$ Assume that

each link has a positive $($greater than $0)$ cost$,$ and the cost of each link is the same in both

directions. Taking this into consideration, how can you improve the efficiency of RPF $($i$.$e$.$

reduce the number of messages it transmits?$)$