C-Language. Stacks or Trees.I am having issues with this program. I am trying to achieve this currently by using a stack in the C language. But I have reached a lull. Monkey BusinessObjectiveGive practice with Trees (or tree-like input) in C.Give practice with Stacks in C.StoryYour park has a new layout. The park is modeled as a collection of exhibits (including the entrance of thepark) each with their own unique ID. There are also paths in your park. Each path connects a pair ofexhibits. Additionally, between each pair of exhibits there is exactly 1 sequence of unique paths thatconnects. One aspect of the park that draws in a lot of guests are the monkeys that hang around eachexhibit (including the entrance of the park).Guests that visit your park love to see a lot of monkeys. However, the guests are very busy, so theytypically have time to walk from the entrance to one particular exhibit, then walk back to the entrance toleave. They don't visit any more exhibits than necessary. You were going to give the visitors a map sothat they could plan out the visits that would enable them to visit the most monkeys, but someone swipedyour reference map. Now you want to settle for telling the guests how many distinct monkeys they willsee in their visit to your park.Luckily, you have a dedicated employee that walked the entire park to give you a report of the existingpathways and the monkeys at each location. The employee started at the entrance and crossed allpathways exactly twice. The first time the employee reached a location they wrote down a unique integerID for the location and the number of monkeys they saw. Everytime they used a pathway a second timethey reached an exhibit they had already seen, so they noted that the exhibit had already been recorded intheir notes. The employee may have visited an exhibit multiple times.ProblemGiven the employee's traversal of the park, and the exhibits that the visitors want to visit determine howmany unique monkeys the visitor will see on their way from the entrance to the exhibit and then back.InputInput will begin with a line containing 1 integer, n (1 ≤n≤200,000), representing the number of exhibitsin the park (including the entrance). The following line contains 2 integers, i and m (i = 1; 1 ≤ m

Question

C-Language. Stacks or Trees.I am having issues with this program. I am trying to achieve this currently by using a stack in the C language. But I have reached a lull. Monkey BusinessObjectiveGive practice with Trees (or tree-like input) in C.Give practice with Stacks in C.StoryYour park has a new layout. The park is modeled as a collection of exhibits (including the entrance of thepark) each with their own unique ID. There are also paths in your park. Each path connects a pair ofexhibits. Additionally, between each pair of exhibits there is exactly 1 sequence of unique paths thatconnects. One aspect of the park that draws in a lot of guests are the monkeys that hang around eachexhibit (including the entrance of the park).Guests that visit your park love to see a lot of monkeys. However, the guests are very busy, so theytypically have time to walk from the entrance to one particular exhibit, then walk back to the entrance toleave. They don't visit any more exhibits than necessary. You were going to give the visitors a map sothat they could plan out the visits that would enable them to visit the most monkeys, but someone swipedyour reference map. Now you want to settle for telling the guests how many distinct monkeys they willsee in their visit to your park.Luckily, you have a dedicated employee that walked the entire park to give you a report of the existingpathways and the monkeys at each location. The employee started at the entrance and crossed allpathways exactly twice. The first time the employee reached a location they wrote down a unique integerID for the location and the number of monkeys they saw. Everytime they used a pathway a second timethey reached an exhibit they had already seen, so they noted that the exhibit had already been recorded intheir notes. The employee may have visited an exhibit multiple times.ProblemGiven the employee's traversal of the park, and the exhibits that the visitors want to visit determine howmany unique monkeys the visitor will see on their way from the entrance to the exhibit and then back.InputInput will begin with a line containing 1 integer, n (1 ≤n≤200,000), representing the number of exhibitsin the park (including the entrance). The following line contains 2 integers, i and m (i = 1; 1 ≤ m<5,000), representing the ID of the entrance and the number of monkeys at the entrance. Each of thefollowing 2n - 2 lines will contain a path description recorded by our employee. If this is the first timethe employee used the path, then the line will contain two integers, i and m (2 ≤ i ≤ n; 1 ≤ m ≤ 5,000),representing the ID of the destination exhibit and the monkeys at the destination exhibit respectively. Ifthis is the second time the path is used, then the line will contain the integer -1 instead, since the ID andnumber of monkeys were already recorded. You can assume that the monkeys don't move betweenexhibits. The following line contains a single integer, v (1 ≤ v≤ 500,000), representing the number of visitors to thepark. The following lines will each contain a single integer, e (1 ≤ e ≤ n), representing the ID of theexhibit that the guest is going to visit.OutputOutput should contain v lines. Each line will contain a corresponding integer representing the number ofunique monkeys seen in the corresponding visitor's park visit. The order of the output should correspondto the order of the input.Sample Input41 102 134 25-13 6-1-1MI IMAM N343251 1223 3-177-14 45 5UT W NA-1-1235Sample Output48∞00329N N23610

Accepted Answer

Description:
Given the employee's traversal of the park, and the exhibits that the visitors want to…