Define a scheme procedure (mult-position lst) which multiplies each item in list lst by its position in the list. assume the car of the list is position 1. for example: (mult-position '(1 2 3 4 5)) => (1 4 9 16 25) (mult-position '(1 1 1 1 1)) => (1 2 3 4 5) (mult-position '(5 4 3 2 1)) => (5 8 9 8 5)

-2/

< 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)

what is the rest of the question? ?

answer: 75°

step-by-step explanation:

∠esk is the supplement of ∠edk, so is 100°. ∠esd = 1/2·arc ed, so is 25°.

since ∠esk = ∠esd + ∠dsk

you have 100° = 25° + ∠dsk . .

fill in known values 75° = ∠dsk . . . . .

subtract 25°

step-by-step explanation: