Answer:
there are 380 seats in total
Step-by-step explanation:
286 + 18 = 304 which is four-fifths of the seat. since 304 seats is 80% of the total seats then if you divide it by 80 then multiply it by 100 you get 380.
so one fifth would be 76 seats and if you multiply it by 4 you get 304 which is four fifths of the seat.
Answer:
Explanation:
Given:
The equation describing the forest wood biomass per hectare as a function of plantation age t is:
y(t) = 5 + 0.005t^2 + 0.024t^3 − 0.0045t^4
The equation that describes the annual growth in wood biomass is:
y ′ (t) = 0.01t + 0.072t^2 - 0.018t^3
To find:
a) The year the annual growth achieved its highest possible value
b) when does y ′ (t) achieve its highest value?
a)
To determine the year the highest possible value was achieved, we will set the derivative y'(t) to zero. The values of t will be substituted into the second derivative to get the highest value


SInce t = 4.13, gives y ′' (t) = -0.316 (< 0). This makes it the maximum value of t
The year the annual growth achieved its highest possible value to the nearest whole number will be
year 4
b) y ′ (t) will achieve its highest value, when we substitute the value of t that gives into the initial function.
Initial function: y(t) = 5 + 0.005t^2 + 0.024t^3 − 0.0045t^4
Answer:
The answer stays the same.
Step-by-step explanation:
For example, if you have 1/2 and multiply the numerator and the denominator by 4, you get 4/8. 4 divided by 8 still gives you 1/2.
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)).