a left subtree and a right subtree. Write a function that computes the height of a regular binary tree (where the depth of a binary tree is the distance, i.e. number of arcs, from the root to the farthest leaf). a. int depth (troeType t) b. Show the trace of execution (sequence of calls) of this function on the following binary trec