B,C and D are correct because all of those choices include letters which are arranged in order from left of right.
Answer:

Step-by-step explanation:
Given an inequality that relates the height h, in centimeters, of an adult female and the length f, in centimeters, of her femur by the equation

If an adult female measures her femur as 32.25 centimeters, we can determine the possible range of her height by plugging f = 32.25cm into the modelled equation as shown:

If the modulus function is positive then:

If the modulus function is negative then:

multiply through by -1

combining the resulting inequalities, the estimate of the possible range of heights will be 
Assuming a d-heap means the order of the tree representing the heap is d.
Most of the computer applications use binary trees, so they are 2-heaps.
A heap is a complete tree where each level is filled (complete) except the last one (leaves) which may or may not be filled.
The height of the heap is the number of levels. Hence the height of a binary tree is Ceiling(log_2(n)), for example, for 48 elements, log_2(48)=5.58.
Ceiling(5.58)=6. Thus a binary tree of 6 levels contains from 2^5+1=33 to 2^6=64 elements, and 48 is one of the possibilities. So the height of a binary-heap with 48 elements is 6.
Similarly, for a d-heap, the height is ceiling(log_d(n)).
Answer:
25
Step-by-step explanation: