1.1 The test questions There are two questions that you need to study for the test. Assume that all keys in the BST are distinct. Node* lca(int, int). Any two nodes in a BST (or any tree for that matter) have a least common ancestor (LCA). This is the node furthest from the root that is an ancestor of both nodes. This function returns a pointer to the LCA of the nodes that contains keys corresponding to the arguments. Thus lca(vali, val2) returns (a pointer to the LCA of the nodes containing vall and val2 as keys. If either of these values is not present in the tree, return NULL. int width(). Define a level to be the set of nodes at the same distance from the root. The width is the size of the largest level. This function simply returns the width, as an int