Let T be a tree with n positions (nodes). Define the lowest common ancestor (LCA) between two positions v and w as the lowest position in T that has both v and w as descendants (where we allow a position to be a descendant of itself). Given two positions v and w, describe an efficient algorithm in pseudocode for finding the LCA of v and w. What is the running time of your algorithm?