The set of full binary trees is defined as follows Basis: A single vertex with no edges is a full binary tree. The root is the only vertex in the tree. Recursive rule: If T1 and T2 are full binary trees, then a new tree T' can be constructed by first placing T1 to the left of T2, adding a new vertex v at the top and then adding an edge between v and the root of T1 and an edge between v and the root of T2. The new vertex v is the root of T'. Suppose that a full binary tree T' is created using the recursive rule applied to full binary trees T1 and T2. Let v(T) denote the number of vertices in tree T. Which expression correctly describes v(T")?
a. v( T') =v( Tl) + v( T2) + 1
b. v( T') =2v( Tl) + 2v( T2) + 1
c. v( T') =v( Tl) 2v( T2)
d. v( T') = 2v( Tl) + 2v( T2)

Draw the hierarchy chart and design the logic for a program that calculates service charges for hazel's housecleaning service. the program contains housekeeping, detail loop, and end-of-job modules. the main program declares any needed global variables and constants and calls the other modules. the housekeeping module displays a prompt for and accepts a customer's last name. while the user does not enter for the name, the detail loop accepts the number of bathrooms and the number of other rooms to be cleaned. the service charge is computed as $40 plus $15 for each bathroom and $10 for each of the other rooms. the detail loop also displays the service charge and then prompts the user for the next customer's name. the end-of-job module, which executes after the user enters the sentinel value for the name, displays a message that indicates the program is complete.

Create a word problem that involves calculating the volume and surface area of a three-dimensional object. cube: surface area 6 s2 , volume s3

The head restraint should be adjusted so that it reaches a.the top of your ears b.the base of your skull c.the top of the head