Having a maximum flow in a transportation network, find the maximum flow for the same network if exactly 1 edge changes its capacity.

Question

I have an idea for the c) problem, finding an augmenting path from network R to network R1, and then applying the same procedure until i get the maximum flow for Rp, its similar to what Ford_Fulkerson does, but i have no idea how to approach d). Please, help me!