Let f(n) be the average number of full nodes in an n-node binary search tree.
a. determine the values of f(0) and f(1).
b. show that for n > 1
f(n)=n−2 /n +1/ n (sum n−1 i=0(f(i)+f(n−i−1)) start at i = 0 end at n-1 for the summation
c. show (by induction) that f(n)=(n−2)/3 is a solution to the equation in part (b), with the initial conditions in part (a).
d. use the results of exercise 4.6 to determine the average number of leaves in an n-node binary search tree.

In the film "epic 2015," epic is the name for:

Consider the simple 3-station assembly line illustrated below, where the 2 machines at station 1 are parallel, i.e., the product only needs to go through one of the 2 machines before proceeding to station 2.what is the throughput time of this process?

1)consider the following code snippet: #ifndef book_h#define book_hconst double max_cost = 1000.0; class book{public: book(); book(double new_cost); void set_cost(double new_cost); double get_cost() const; private: double cost; }; double calculate_terms(book bk); #endifwhich of the following is correct? a)the header file is correct as given.b)the definition of max_cost should be removed since header files should not contain constants.c)the definition of book should be removed since header files should not contain class definitions.d)the body of the calculate_terms function should be added to the header file.