Four workers are available to perform jobs 1–4. unfortunately, three workers can do only certain jobs: worker 1, only job 1; worker 2, only jobs 1 and 2; worker 3, only job 2; worker 4, any job. draw the network for the maximum-flow problem that can be used to determine whether all jobs can be assigned to a suitable worker.

answer: bea's uncle is 25 years old.

step-by-step explanation:

given the equation , we can say that the variable "x" represents the age of bea's uncle. then to find his age, we need to solve for "x":

we must add 15 to both sides of the equation:

now we need to divide both sides of the equation by 3:

therefore, we can conclude that bea's uncle is 25 years old.

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

y= 2x+7

changed to y= 5x +7

as slope is increased from 2 to 5

therefore it would be less steeper

so, option d) is correct