B bsbdhdbhhdjddjdjdndhdhdhdgdggdhdhdhdhdhdhdhdhdhdhd
Answer:
See proof below
Step-by-step explanation:
We have to verify that if we substitute in the equation the equality is true.
Let's substitute first in the right hand side:
Now we use the distributive laws. Also, note that (this also works when the power is n-2).
then the sequence solves the recurrence relation.
Let A = {0,1,2,3,4,5}<br>B = {2,4,6,8}<br>C= {1,3,5,7}<br>Verity (AUB) UC=AU (BUC) <br>
Angelina_Jolie [31]
<em><u>Hope</u></em><em><u> </u></em><em><u>this</u></em><em><u> </u></em><em><u>will</u></em><em><u> </u></em><em><u>help</u></em><em><u> </u></em><em><u>u</u></em><em><u>.</u></em>
<em><u>If</u></em><em><u> </u></em><em><u>my</u></em><em><u> </u></em><em><u>ans</u></em><em><u> </u></em><em><u>was</u></em><em><u> </u></em><em><u>helpful</u></em><em><u>,</u></em><em><u> </u></em><em><u>u</u></em><em><u> </u></em><em><u>can</u></em><em><u> </u></em><em><u>follow</u></em><em><u> </u></em><em><u>me</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em><em><u>.</u></em>