Company: Barclays
Difficulty: medium
Oil Pipeline Network Java JDK 1.8 Note: The main class name must be \"Solution\". We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use System.out.println() to debug your code. The System.out.println() may not work in case of syntax/runtime error. Theon is an energy engineer. His job is to transport oil from the base refinery to the main storage units through a network of pipes. The network is in the form of a tree, where the base refinery is the root and the main storage units are the leaves. The pipes are connected to the storage units via internal connection stations. The pipes can have different transfer rates [liter of oil per unit of time]. He wishes to determine the maximum amount of oil that can be transported via the network at any given time. Write an algorithm to help Theon find the maximum amount of oil that can be transported via the network at any given time. Input F