Youve just finished writing your Great American Novel and think that it is so great that even non-Americans should have the privilege of reading it. Youve hired a set of translators, many of whom can translate English into several other languages. For some languages the translations are simple enough that you need only one person to work on the translation. For other languages, though, you would like to have 2 or more translations (the exact number depending on the intricacy of the language) so that you can pick the one that best captures the brilliance of your prose. Another constraint is time: You need the translations in a month. Some translators are faster than others and can produce two or more translations in that time, while other will only be able to produce one in a month. What you would like to know is the following: given a set of translators and their abilities, are you able to get all the translations you want? For example, suppose there are 3 translators A, B, and C and 5 languages you want your book translated into V, W, X, Y and Z. The table below shows the abilities of the workers:

If you need 2 translations into V and Z and one translation into the other three languages, this is possible in one month. However, if you need two W and Y translations and one translation of the other three, this is not possible. Write a program in java to solve this problem. Your code must use Ford-Fulkerson maximum flow algorithm.

Output :

At the very least your program should output Yes or No depending on whether the requested translations can be produced in a month.

and if you can also output the translation assignments in the case of a Yes answer.

can translate to Translator V WXYZ # of translations per month 3 can translate to Translator V WXYZ # of translations per month 3