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
Answer:
192- -6 + -12y
Step-by-step explanation:
The answer for this problem is39906
Consider, please, this solution/explanation:
1. suppose, that number of cars is 'x', numbers of buses is 'y'.
2. according to the condition 'a total of 32', it means that x+y=32. This is the 1st equation.
3. according to the condition in one car are 3x persons, in one bus are 27y persons, and totaly 3x+27y=408 people. This is the 2d equation.
4. if to solve the system of two equations:

Answer: 13 - b., 19 - c.
That's exponential decay.