[3 + 1 = 4 points] Give pseudo-code of the algorithm least-common-ancestor that takes as input two nodes v and w in a tree T, and that gives as output the least common ancestor of v and w in T. What is the time complexity of your algorithm in terms of O