The Shredder, Inc. produces two types of paper shredders, home and office. The office model requires 6 hours to assembly and 2 finishing work units for finishing work, the home model requires 4 hours to assemble and 12 finishing work units for finishing. The maximum number of assembly hours available is 96 per day, and the maximum number of finishing hours available is 96 per day. Let
x = the number of office model shredders produced per day and
y = the number of home model shredders produced per day.

Write the system of inequalities that represents the maximum number of shredders that can be produced in one day.

NOTE: 4 inequalities are expected.

4y + 6x ≤ 96

12y + 2x ≤ 96

Step-by-step explanation:

Paper shredders produced :

Home :

Assembling time = 4 hours

Finishing work unit = 12

Office :

Assembling time = 6 hours

Finishing work unit = 2

Maximum number of assembly hours = 96 / day

Maximum number of finishing hours = 96/ day

Let

x = the number of office model shredders produced per day and

y = the number of home model shredders produced per day

(office Assembly hours x Number of office model) + (Assembly hours * number home models)

OFFICE MODEL:

Assembly operation :

Home + office ≤ 96

4y + 6x ≤ 96

Finishing operation :

Home + office ≤ 96

12y + 2x ≤ 96

the answer is b. 60. each interior angle in 120, so the exterior angle must be 60 in order to add up to 180

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)