4. [DPDC] The Dhaka Power Distribution Company [DPDC] network contains n power plants and n3 buildings, pairs of which may be directly connected to each other via bidirectional wires. Every building...

Algorithms,Kindly solve accordingly

Extracted text: 4. [DPDC] The Dhaka Power Distribution Company [DPDC] network contains n power plants and n3 buildings, pairs of which may be directly connected to each other via bidirectional wires. Every building is powered by either: having a wire directly to a power plant, or having a wire to another building that is recursively powered. Note that the network has the property that no building could be powered by more than one power plant. DPDC has secured funds to install an emergency generator in one of the power plants, which would provide backup power to all buildings powered by it, were the power plant to fail. Given a list L of all the wires in the network, describe an O(nº)-time algorithm to determine the power plant where DPDC should install the generator that would provide backup power to the most buildings upon plant failure. [We are expecting: A description of the algorithm, a brief explanation of why the algorithm works and an informal justification of the algorithm's running time.]