3 Divide and conquer algorithm

You are given a rooted tree T with n nodes. The tree may not be binary. You want to find the depth of T . Here, we define the depth of a node v in the tree to be the maximum number of nodes along a path from v to a leaf under v (going downwards). The depth of T is the depth of the root of T . Now give a divide and conquer algorithm for finding the depth of a tree. You need to analyze its running time.