It’s 36 I looked it up and I did this before have a good day anything else?
Answer:
A - 90 units
B = 0 units
Step-by-step explanation:
Here we have two models A and B with the following particulars
Model A B (in minutes)
Assembly 20 15
Packing 10 12
Objective function to maxmize is the total profit
where A and B denote the number of units produced by corresponding models.
Constraints are

These equations would have solutions as positive only
Intersection of these would be at the point
i) (A,B) = (60,40)
Or if one model is made 0 then the points would be
ii) (A,B) = (90,0) oriii) (0, 90)
Let us calculate Z for these three points
A B Profit
60 40 1040
90 0 1080
0 90 720
So we find that optimum solution is
A -90 units and B = 0 units.
Answer:
32 minutes.
Step-by-step explanation:
third place took 34 minutes.
second place took 33 minutes.
first place took 32 minutes.
<h3>
P(call a person not from his neighborhood) = 
</h3>
Step-by-step explanation:
Here, the total number of contacts in the list if Bruce = 25 contacts
The total number of neighbors in the contact = 20 people
Now, let E: Event of calling a person from his neighborhood
So, P(E) = 
So, the probability of calling a person from his neighborhood is 
⇒P(E) =
Now,as we know: P(E) + P(not E) = 1
So, the probability of NOT calling a person from neighborhood
= 1 - probability of calling a person from his neighborhood

⇒P( not E) = 
Hence, P(call a person not from his neighborhood) = 
If you are given a function such
as f(x), it means that f(x) is dependent on the value of x. When finding the
points that would correspond to the given function, it is written as (x,f(x)). The
f(0) = 6 is the same as the point (0, 6).