Note: All functions must be given in Pseudocode

1 [10 Points) Write a function int numHalfNodes (Node *v), which takes as argument the (pointer to) a node v of a binary tree and determines the number of half nodes in the subtree rooted at v. A half node is one which has exactly one child. 2 [10 Points] Write a function boolean isLeftSkewed (Node *v), which takes as argument the (pointer to) the root of a binary tree and determines if the tree is left-skewed i.e., there are no internal nodes with a right-child