In the parallelogram ABCD, join BD.
Consider the triangle Δ ABD.
It is given that AB > AD.
Since, in a triangle, angle opposite to longer side is larger, we have,
∠ ADB > ∠ ABD. --- (1)
Also, AB || DC and BD is a transversal.
Therefore,
∠ ABD = ∠ BDC
Substitute in (1), we get,
∠ ADB > ∠ BDC.
Answer:
a) Bar chart
b) Histogram
c) Bar chart
d) Histogram
Step-by-step explanation:
a) Trash pick-up DAY for each HOUSEHOLD in Ames - This is categorical data because, we are talking about days of the week. For instance, Household 1 might have Sunday as Trash pick-up day and that could be accumulated into frequency. Hence, BAR chart is the most appropriate.
b) Patient WAIT-TIME at ISU. This is continuous (quantitative) data. And the most appropriate is HISTOGRAM.
c) Number of trips taken during a GIVEN SCHOOL YEAR by EACH ISU STUDENT. Let say we have 5 ISU STUDENTS. Student 1 had 5 trips, student 2 had 10 trips, etc.
We want to see which student has the most and least trip in that particular school year. Although is count data but the most appropriate graphical display is BAR chart.
d) TAX BRACKET of ALL Iowa RESIDENTS. This is a continuous (quantitative) data. The most appropriate graphical display is HISTOGRAM.
Your answer is 22.09. I hope you get right
48 since he eats 4 a minute and 4 times 12 equals 48.
I will be using the language C++. Given the problem specification, there are an large variety of solving the problem, ranging from simple addition, to more complicated bit testing and selection. But since the problem isn't exactly high performance or practical, I'll use simple addition. For a recursive function, you need to create a condition that will prevent further recursion, I'll use the condition of multiplying by 0. Also, you need to define what your recursion is.
To wit, consider the following math expression
f(m,k) = 0 if m = 0, otherwise f(m-1,k) + k
If you calculate f(0,k), you'll get 0 which is exactly what 0 * k is.
If you calculate f(1,k), you'll get 0 + k, which is exactly what 1 * k is.
So here's the function
int product(int m, int k)
{
if (m == 0) return 0;
return product(m-1,k) + k;
}
