$5.$ Design an efficient algorithm such that, given a flow network G$,$ it outputs a minimum cut that contains the smallest number of edges $($among all minimum cuts$).$ Hint: Find a way to modify the sedge capacities so that minimum cuts in the modified network correspond to the desired cuts in the original network G$.$