Answer:
<h3>For two events A and B show that P (A∩B) ≥ P (A)+P (B)−1.</h3>
By De morgan's law

which is Bonferroni’s inequality
<h3>Result 1: P (Ac) = 1 − P(A)</h3>
Proof
If S is universal set then

<h3>Result 2 : For any two events A and B, P (A∪B) = P (A)+P (B)−P (A∩B) and P(A) ≥ P(B)</h3>
Proof:
If S is a universal set then:

Which show A∪B can be expressed as union of two disjoint sets.
If A and (B∩Ac) are two disjoint sets then
B can be expressed as:

If B is intersection of two disjoint sets then

Then (1) becomes

<h3>Result 3: For any two events A and B, P(A) = P(A ∩ B) + P (A ∩ Bc)</h3>
Proof:
If A and B are two disjoint sets then

<h3>Result 4: If B ⊂ A, then A∩B = B. Therefore P (A)−P (B) = P (A ∩ Bc) </h3>
Proof:
If B is subset of A then all elements of B lie in A so A ∩ B =B
where A and A ∩ Bc are disjoint.

From axiom P(E)≥0

Therefore,
P(A)≥P(B)
Answer:

Step-by-step explanation:
We are given 2 fractions.
1st fraction is Negative StartFraction 3 over 8
i.e.

2nd fraction is negative one-fourth
i.e.

We have to find the quotient when 1st fraction is divided by 2nd fraction.
<u>Definition</u> of quotient is given as:
Quotient is the result obtained when one number is divided by other number.

is converted to
and the 2nd fraction is reversed i.e.
if the fraction is
it becomes
and the sign
is changed to
.
Solving above:

So, the quotient is
.