Answer:
The discriminant of f is 92, and it has no real zeros
Step-by-step explanation:
The discriminant of a quadratic is
, where the quadratic is in the form
. The discriminant of this one is therefore:

Since the square root of a negative number is imaginary, this quadratic has no real number zeros. Hope this helps!
A truth table is a way of organizing information to list out all possible scenarios. We title the first column p for proposition. In the second column we apply the operator to p, in this case it's ~p (read: not p). So as you can see if our premise begins as True and we negate it, we obtain False, and vice versa.
Answer:
(a) See attachment for tree diagram
(b) 24 possible outcomes
Step-by-step explanation:
Given


Solving (a): A possibility tree
If urn 1 is selected, the following selection exists:
![B_1 \to [R_1, R_2, R_3]; R_1 \to [B_1, R_2, R_3]; R_2 \to [B_1, R_1, R_3]; R_3 \to [B_1, R_1, R_2]](https://tex.z-dn.net/?f=B_1%20%5Cto%20%5BR_1%2C%20R_2%2C%20R_3%5D%3B%20R_1%20%5Cto%20%5BB_1%2C%20R_2%2C%20R_3%5D%3B%20R_2%20%5Cto%20%5BB_1%2C%20R_1%2C%20R_3%5D%3B%20R_3%20%5Cto%20%5BB_1%2C%20R_1%2C%20R_2%5D)
If urn 2 is selected, the following selection exists:
![B_2 \to [B_3, R_4, R_5]; B_3 \to [B_2, R_4, R_5]; R_4 \to [B_2, B_3, R_5]; R_5 \to [B_2, B_3, R_4]](https://tex.z-dn.net/?f=B_2%20%5Cto%20%5BB_3%2C%20R_4%2C%20R_5%5D%3B%20B_3%20%5Cto%20%5BB_2%2C%20R_4%2C%20R_5%5D%3B%20R_4%20%5Cto%20%5BB_2%2C%20B_3%2C%20R_5%5D%3B%20R_5%20%5Cto%20%5BB_2%2C%20B_3%2C%20R_4%5D)
<em>See attachment for possibility tree</em>
Solving (b): The total number of outcome
<u>For urn 1</u>
There are 4 balls in urn 1

Each of the balls has 3 subsets. i.e.
![B_1 \to [R_1, R_2, R_3]; R_1 \to [B_1, R_2, R_3]; R_2 \to [B_1, R_1, R_3]; R_3 \to [B_1, R_1, R_2]](https://tex.z-dn.net/?f=B_1%20%5Cto%20%5BR_1%2C%20R_2%2C%20R_3%5D%3B%20R_1%20%5Cto%20%5BB_1%2C%20R_2%2C%20R_3%5D%3B%20R_2%20%5Cto%20%5BB_1%2C%20R_1%2C%20R_3%5D%3B%20R_3%20%5Cto%20%5BB_1%2C%20R_1%2C%20R_2%5D)
So, the selection is:


<u>For urn 2</u>
There are 4 balls in urn 2

Each of the balls has 3 subsets. i.e.
![B_2 \to [B_3, R_4, R_5]; B_3 \to [B_2, R_4, R_5]; R_4 \to [B_2, B_3, R_5]; R_5 \to [B_2, B_3, R_4]](https://tex.z-dn.net/?f=B_2%20%5Cto%20%5BB_3%2C%20R_4%2C%20R_5%5D%3B%20B_3%20%5Cto%20%5BB_2%2C%20R_4%2C%20R_5%5D%3B%20R_4%20%5Cto%20%5BB_2%2C%20B_3%2C%20R_5%5D%3B%20R_5%20%5Cto%20%5BB_2%2C%20B_3%2C%20R_4%5D)
So, the selection is:


Total number of outcomes is:



Answer:
Option B y=3x -2 is the answer.
Step-by-step explanation:
An easy way to quickly figure it out is to find the y-intercept of the graph. So, from the graph you can see that the line cuts the y axis at -2. Therefore, as per the equation of a straight line, y=mx+c
option B shows that the y intercept is -2. Thus option B is the answer to this question.