Company: ibm_10sep
Difficulty: medium
Network Recovery Problem Description Your team manages a distributed system of network_nodes . A major incident occurs, and the primary server with ID company begins recovery operations. Each node is connected via bidirectional links. Due to the incident, many systems are offline, and your goal is to bring systems back up in a specific order based on the following rules: Start from the main node ( company ); it is already online. Bring systems back up in order of proximity (shortest number of hops from company ). If multiple systems are equally distant, recover the one with the lower node number first. Ignore isolated nodes — if a system is unreachable, it cannot be recovered yet. The function recoverNetwork takes the following four inputs: int network_nodes : the number of nodes in the network int network_from[] : the first node where there is a bidirectional edge int network_to[] : the second node where there is a bidirectional edge int company : the node from which the recovery star