Company: Dealshare_7oct
Difficulty: medium
Treasure Hunt in Ancient Ruins Problem Description You are an archaeologist exploring an ancient ruin consisting of N hidden chambers (numbered 1 to N), connected by M secret tunnels. Each tunnel allows movement between two chambers but can only be used in one direction. A treasure is known to be located in a specific chamber D, and you start your journey from a given chamber S. Your task is to determine whether you can reach the treasure and, if so, count the number of different chambers you pass through before reaching it (excluding the starting chamber). If reaching the treasure is impossible, return -1. You must implement the function findTreasurePath . int findTreasurePath (int N, int M, int S, int D, vector<vector<int>> tunnels) { // Write your code here. } Parameters: int N : Number of chambers (nodes). int M : Number of secret tunnels (edges). int S : Starting chamber. int D : Chamber containing the treasure. vector<vector<int>> tunnels : A list of M tup