Rank Finding in Tree. Consider a tree where each entity x has an initial value v(x); these values are not necessarily distinct. The rank of an entity x will be the rank of its value; that is, rank(x)= 1 + |{y ∈ V : v(y) < v(x)}. So, whoever has the smallest value, it has rank 1. Design an efficient protocol to determine the rank of a unique initiator (i.e., under the additional restriction UI).