Suppose each position p of a binary tree T is labeled with its value f (p) in a level numbering of T. Design a fast method for determining f (a) for the lowest common ancestor (LCA), a, of two positions p and q in T, given f (p) and f (q). You do not need to find position a, just value f (a).