Write a recursive function called findSecondSmallest for the BinarySearchTree class that returns a pointer to the node containing the second smallest item. If there is no such item, then return nullptr. The function prototype is shown below. BinaryNode * findSecondSmallest (BinaryNode* t) const;