I would have to say the second
Answer:
B
Step-by-step explanation:
For a relationship to be a function
Each value of x in the domain can only have 1 unique value of y in the range. That is, one-to-one correspondence.
The only relation which meets this criteria is B
<h2>
Answer:</h2>
<em><u>Recursive equation for the pattern followed is given by,</u></em>

<h2>
Step-by-step explanation:</h2>
In the question,
The number of interaction for 1 child = 0
Number of interactions for 2 children = 1
Number of interactions for 3 children = 5
Number of interaction for 4 children = 14
So,
We need to find out the pattern for the recursive equation for the given conditions.
So,
We see that,

Therefore, on checking, we observe that,

On checking the equation at the given values of 'n' of, 1, 2, 3 and 4.
<u>At, </u>
<u>n = 1</u>

which is true.
<u>At, </u>
<u>n = 2</u>

Which is also true.
<u>At, </u>
<u>n = 3</u>

Which is true.
<u>At, </u>
<u>n = 4</u>

This is also true at the given value of 'n'.
<em><u>Therefore, the recursive equation for the pattern followed is given by,</u></em>

Nice question hey there! need help!?