Let x represent the number of type A table and y represent the number of type B tables.
Minimize: C = 265x + 100y
Subject to: x + y ≤ 40
25x + 13y ≥ 760
x ≥ 1, y ≥ 1
From, the graph the corner points are (20, 20), (39, 1), (30, 1)
For (20, 20): C = 265(20) + 100(20) = $7,300
For (39, 1): C = 265(39) + 100 = $10,435
For (30, 1): C = 265(30) + 100 = $8,050
Therefore, for minimum cost, 20 of type A and 20 of type B should be ordered.
Answer:
the answer here is C) translation, then reflection
Step-by-step explanation:
if you translate point P to point R and then translate across that point they map onto each other
This is the following condition in order to get the specific output for this specific problem: if is_a_prime(n):<span> is_prime = True</span> <span><span>Now all you have to do is write is_a_prime().
For the hard code for this problem:
</span>if n == 2:<span>
is_prime = True
elif n % 2 == 0:
is_prime = False
else:
is_prime = True
for m in range (3, int (n * 0.5) + 1, 2):
if n % m == 0:
is_prime = False
<span>break.</span></span></span>
<span>
To add, a high-level programming language that is widely used for general-purpose programming<span>, created by Guido van Rossum and first released in 1991 is called Python.</span></span>
