i will downvote who spams the code and provide incorrect question

Prove that the Ford-Fulkerson algorithm will still compute the maximum flow of a network in a finite amount of time if we allow edge capacities to be positive rational numbers, where a rational number is one that can be written in the form a/b where a and b are integers. You do not need to specify the exact run time in this setting (you just need to show the algorithm eventually terminates with the correct answer)