Step-by-step explanation:
this is a linear programming problem, and we are expected to draw up the linear program for the solution of the problem.
The objective function is
Maximize
35A+42B+20C=P
subject to constraints(board and wicker)
The constraints are
board
7A+5B+4C=3000
wicker
4A+5B+3C=1400
A>0, B>0, C>0
The Northeast is a geographical region of the United States of America bounded to the North by Canada. The Northeast is one of 4 regions defined by the Census Bureau for the collection and analysis of statisitics. Hope that helped!!
and h(x)= 2x-8
g o h is a composition function
First we find g o h
g o h is g(h(x))
We plug in h(x) in g(x)
We replace x with 2x-8 in g(x)


To find domain we look at the domain of h(x) first
Domain of h(x) is set of all real numbers
now we look at the domain of g(h(x))
Negative number inside the square root is imaginary. so we ignore negative number inside the square root
So to find domain we set 2x - 12 >=0 and solve for x
2x - 12 >=0
add both sides by 12
2x >= 12
divide both sides by 2
x > = 6
The answer may be 36 but I am not very sure