The following Python 3 code is an example of what principle? bruce = 5 print (bruce,) bruce = 7 print (bruce) Select one:

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)?