Write efficient algorithms that takes only a pointer to the root of a binary tree T (this is a general binary tree, may not necessarily a binary search tree) and compute:

a. The number of nodes in T.

b. The number of leaves in T