3. Show a tree of achieving the worst-case running time for the following algorithm depth. Assume that the size of the tree is n (6 points). Public int depth (Position p) { if (isRoot(p)) return 0; else return 1+ depth (parent(p));