Acompany manufactures an assembly consisting of a frame, a shaft, and a ball bearing. the company manufactures the shafts and frames but purchases the ball bearings from a ball bearing manufacturer. each shaft must be processed on a forging machine, a lathe, and a grinder. these operations require 0.6 hour, 0.3 hour, and 0.4 hour per shaft, respectively. each frame requires 0.8 hour on a forging machine, 0.2 hour on a drilling machine, 0.3 hour on a milling machine, and 0.6 hour on a grinder the company has 5 lathes, 10 grinders, 20 forging machines, 3 drillers, and 6 illers. assume that each machine operates a maximum of 2400 hours per year. formulate the problem of finding the maximum number of assembled components that can be produced as a linear program.

4

step-by-step explanation:

im pretty sure it's 4 beacsue 8/2 equals 4

a, b, c, d are correct.

step-by-step explanation:

we have g(x) = 3 and are required to find which option is a translation of g(x).

now, 'translation' is a transformation which means to shift the function in any direction and the general form of translation is g(x) + k, where k is any real number.

so, according to the options we see that all are correct as they satisfy the general form of translation.

also, it can be seen from the graph below that the function g(x) = 3 is shifted from its position in all the four options.

step-by-step explanation: given equation a = h(b 1+b 2)

also we are given values of a, h and b 1 as :

a = 16, h = 4, and b 1 = 3.

in order to solve it for b 2, we need to plug the given values of   a, h and b 1 .

therefore, plugging values of   a, h and b 1   in given equation, we get

16 = 4( 3 + b 2)

first dividing both sides by 4, we get

4 = 3 + b 2

subtracting 3 from both sides, we get

4 -3 = 3 -3 + b 2

1 = b 2.