1: Problem DescriptionAs stated, given a network graph with a source node and a sink node, calculate the maximum flow in the network. 1.1: Input FormatThe first line contains four positive integers: $

ProblemThe challenge is to determine the correct set of five inputs expected by each of the four safes (s1, s2, s3, s4). Running the binary file prompts you to input guesses sequentially, as demonst