Minimum Data Protection Hierarchy

Problem Statement

Minimum Data Protection Hierarchy Problem Description Rubrik's data protection system organizes protected objects in a hierarchical structure where backup policies cascade down from parent to child objects. The system is configured with a Global Policy (Object 1) that protects all objects. When the Global Policy (Object 1) is the root, all objects are protected. An object (u) is currently inheriting from its parent object (v) and removing the inheritance relationship (u, v) means that (u) will now inherit directly from the Global Policy, reducing its policy depth. Determine the minimum possible depth of the protection hierarchy. Input int total_objects: the number of objects in the hierarchical structure. int object_links[total_objects-1][2]: represents number of links in the hierarchical structure. Each object_links[i][0] is connected to object_links[i][1] . int max_operations: the maximum number of operations. Output int: the minimum possible depth of the hierarchical structure after