Answer:
A A A B B B C C C
Step-by-step explanation:
We have the Greedy algorithm, the solution at any time is considered an optimal algorithm.
In our case the sequence is x x x y y y z z z
In addition to the Greedy algorithm, the first advertiser chooses their choice without considering the minimum methods.
Now we must consider the worst case of greedy algorithm so we must suppose that it starts from advertiser C, then B and followed by A.
Therefore the worst option would come being:
C C C B B B, in addition that A cannot bid for any query.
Which means that the sequence of the balanced algorithm will be A A A B B B C C C
When you're subtracting negatives, you're adding them so... Here's a tip:
-9 - (-83)
So..
-9 + (-83) = -92
The total amount that Chang will received from his wages is the product of his hourly wage times the number of hours he has worked (n). His total savings should not be less than $125. The equation that best describes the situation is,
45 + 7n ≥ 125
Solving for n in the inequality gives an answer of n≥11.42 hours. Thus, he needs to work for at least 12 hours.
Answer:
8 friends
Step-by-step explanation:
each get 3 football cards and 4 baseball cards
use hcf method (highest commen factors)
