In java please. Suppose we are given a binary tree with pre-, post-, and in-order numbers assigned to the nodes. Show how these numbers can be used to answer each of the following questions in constant time:

1. Given a node u, determine the size of the subtree rooted at u.

2. Given a node u, determine the depth of u.

3. Given two nodes u and w, determine if u is an ancestor of w