The number of ways for the jobs to be ordered in the queue so that job A is the first to finish or the last to finish is; 2 * 9!
<h3>How to solve permutation and combination?</h3>
We are told that;
There is a set of 10 jobs in the printer queue.
One of the jobs is job A. Thus, there are 9 other identified jobs.
Number of ways to order this nine jobs = 9!
Since the job A has to be ordered first or last, then;
Number of ways to order job A = 2 ways.
Thus;
Total number of ways to order the jobs in the given order = 2 * 9!
Read more about permutation and combination at; brainly.com/question/4658834
#SPJ4
Answer:
(a, b) = (-8, -29)
Step-by-step explanation:
The two relations can be written as the equations ...
a - b = 21
5a -2b = 18
Subtracting 2 times the first equation from the second, we have ...
(5a -2b) -2(a -b) = (18) -2(21)
3a = -24 . . . . . simplify
a = -8 . . . . . . . divide by 3
Substituting into the first equation, we have ...
-8 -b = 21
-b = 29 . . . . . . add 8
b = -29 . . . . . . multiply by -1
The values of a and b are -8 and -29, respectively.