Given a = {a, b, c}, how many subsets does a have including ø?

what is the model?

step-by-step explanation:

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)

a) at most means it can cost $12 or less

so the inequality sign would be ≤

you would then need to multiply the number of toppings by the 0.35 for each one and add it to the cost of the cheese pizza.

the equation would be 9.99 + 0.35x ≤ 12

b) using the above equation:

9.99 + 0.35x ≤ 12

subtract 9.99 from each side:

0.35x ≤2.01

divide both sides by 0.35:

x ≤ 2.01 / 0.35

x ≤5.74

at most you could have 5 toppings.

the 5 topping pizza would cost: 0.35 x 5 = 1.75 + 9.99 = $11.74