From a given graph, delete minimum number of edges such that there is no path from start node to end node.
Problem Statement :- From a given graph, delete minimum number of edges such that there is no path from start node to end node. Start node : node with minimum value End node : node with maximum value Input format : String array, each element in the array represents an…