Suppose that Ten service customers need service call and the maintenance worker can only service three of them each morning. The customers don't care when they are serviced as long as it is before noon, so the dispatcher does not care who is serviced first, second, or third. Find the number of ways in order of which these customers would be served.

henry ordered 5 large pizzas

step-by-step explanation:

sorry no step by step

lockers 1, 4, 9, 16, 25, 40, and 49 are open

i ran through it by the other answer is wrong

a and c

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)