Counting On tree

You are given rooted tree with $n$ nodes. Node $1$ is root of tree. every node of this tree is colored with some color $c_i$. For all $i$ $(1 \le i \le n)$ you have to find frequency of color which occur maximum number of times in subtree of node $i$. ###Input: - First line of input is $n$ $(1 \le n \le 10^5)$ Number of node. - Next line contain $n-1$ integers $p_2,p_3, \dots , p_n$. (w