[JAVA] Maxumum flow of a network flow graph - URGENT

Hello Freelancers, - The problem is the maximum flow problem of nework flow graph. This problem is to be solved with a library in java(Apache commons math) which I already loaded in the code i will send you. Graphs need to be converted in the from Ax <= B and used with a solver we already use to get the maximum flow. I will give you the project description and the code so far in chat. - Now the problem is generate a random system to be used in the tool, in that case you cannot input the data manually in order to use the tool. Requirement: - program takes a graph as input - program should output the maximum flow of the graph via linear programming(Lp) - Randomize any flow diagram and given such a diagram you should solve the max-flow-problem graph is a flow diagram The budget is $40 and we need it today. I will give you the project description and the code so far in chat. Thank you a lot in advance for your time Best!