You fire 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 u (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. Solve the following recurrence. Show the steps. T(n) = {12T(n/4) + n^1.5, if x greaterthanorequalto 4 1, otherwise T(n) = {T(squareroot n) + logn, if x greaterthanorequalto 4 1, otherwise T(n) = T(n/2) + ominus(1), which is the running time of the binary search