Need help with java program. It says I need to add more information, not sure what else needs to be added. Also, what do you mean by "NA" in the comment?

The first thing the forestry service wants is to build a collection of tasks that their forestry workers complete each day. The service interviewed the workers, each of whom described the tasks they completed on a given day, attaching an importance to the task from 1 to 10. Your teammates have looked at these daily task reports and decided to organize them into a rooted tree, where each path from the tree's root node (a task labelled Open up in the morning with a special importance of 11) follows a worker through their tasks, with the leaf node being the last task they completed that day. An example of how to visualize such a tree is given below: Open up in the morning, 11 Collect litter, 5 Direct visitors, 8 Plant saplings, 3 Report smoke sightings, 10 Record wildlife sightings, 7 Clean the forestry station, 2 Figure 1. An example tree made from the task reports of the forestry service workers You must implement a Tree-based data structure that can store this collection. This Tree must be made up of nodes with (at least) a parent, children, a String describing the task, and an integer ranking the importance of that task. Your task-collection Tree must include attaching and removing nodes, as well as the general supporting Tree methods like reporting the number of nodes and whether it's empty or not. There has also been a special request from someone else on the team for a function that prints to the terminal how many tasks of each importance level are currently in the Tree (for levels 1 to 10, only the opening task should have an 11). For obscure reasons, they've also asked to be sure that this function runs in constant time. You don't have to worry about interface issues, like how exactly people will be finding the nodes they want removed or how to pick which existing node a new node should be attached to these functions can simply receive a reference to a particular node in the tree as a given, and go from there. As for how data is read into the system or displayed, we'll leave that for 2.4, though you're free to come back later and add or modify functions to make that easier