Exercise 10.12.5: ordering jobs in a printer queue. about there are eight different jobs in a printer queue. each job has a distinct tag which is a string of three upper case letters. the tags for the eight jobs are: { lpw, qkj, cdp, usu, bbd, pst, lsa, rhr } (a) how many different ways are there to order the eight jobs in the queue? (b) how many different ways are there to order the eight jobs in the queue so that job usu comes immediately before cdp? (c) how many different ways are there to order the eight jobs in the queue so that either qkj or lpw come last? (d) how many different ways are there to order the eight jobs in the queue so that qkj is either last or second-to-last? (e) how many different ways are there to order the eight jobs in the queue so that job usu comes somewhere before cdp in the queue, although not necessarily immediately before? (f) how many different ways are there to order the eight jobs in the queue so that job usu comes somewhere before cdp in the queue (although not necessarily immediately before) and cdp comes somewhere before bbd (again, not necessarily immediately before)?