Wildlife Sanctuary Tour Management

Problem Statement

Wildlife Sanctuary Tour Management Problem Description You are the manager of a wildlife sanctuary that provides guided tours through different habitats. Each tour group has a specific route they will follow, passing through various habitats. Each habitat can only accommodate one tour group at a time. You are given two arrays: entryHabitat[] and exitHabitat[] , which denote the habitats each tour group will enter and exit from, respectively. Your task is to determine the minimum number of habitats that must be available at the same time to ensure that all tour groups can complete their routes. Function Signature You are expected to implement the following function: int minimumHabitats(int entryHabitat[], int exitHabitat[], int n) { // Function signature should not be modified, else code will not be evaluated int MAX_NUM = 11111; // Placeholder, replace with actual logic return MAX_NUM; } Examples Example 1: Input: entryHabitat = [1, 2, 3, 1, 4, 5], exitHabitat = [3, 4, 5, 2, 6, 7] Outp