$8.(10$ points$)$

a$)$ Write a recursive function that take only a pointer to the root of a tree, T$,$ and compute the number of leave nodes on the tree.

struct TreeNode

$\{$

Comparable element;

TreeNode $*$firstChild;

TreeNode $*$nextSibling;

$\}$ b$)$ What is the running time of your routine?