Design and Explain (no code!) a recursive algorithm to count the number of leaf nodes in any given BST. Assume you have the following available: • Node class is defined (Node contains: integer "key", pointers to left and right nodes. Constructor takes in a value for key, and initializes right/left pointers to nullptr) • A tree is pre-built with all connections made. A pointer named "root" is given, which points to the root node Your algorithm should only need a pointer to the root node in order to work • Your algorithm should aim to return the total number of leaf nodes in the tree . Be sure to explain the base and general case(s) for your algorithm

I want the solution in C++ language i want the solution related to chapter 4 in the 10th edition of the textbook Solving the problems with C++. Also i want the solution that setups the midnight time to 0, and lists all the scenarios (possibilities) from that time and future time within 24 hrs.   4.7: Time Machine Your time machine is capable of going forward in time up to 24 hours. The machine is configured to jump ahead in minutes. To enter the proper number of minutes into your machine, you would like a program that can take a start time (in hours, minutes, and a Boolean indicating AM or PM) and a future time (in hours, minutes, and a Boolean indicating AM or PM) and calculate the difference in minutes between the start and future time. A time is specified in your program with three variables: int hours, minutes; bool isAM; // You can also use a char, i.e. A or P for example, to represent 11:50 PM, you would store: hours = 11,minutes = 50, isAM = false or if using a char, hours =…