please I need an explanation for each answer thank you.

The MLFQ (multi-level feedback queue) is a famous scheduling discipline. It consists of several rules as follows.

1: If Priority(A) > Priority(B), A runs (B doesnt).

2: If Priority(A) = Priority(B), A & B run in round-robin fashion.

3: When a job enters the system, it is placed at the highest priority queue (the topmost queue).

4: Once a job uses up its time slice at a given level, its priority is reduced.

5: After some time period, move all the jobs in the system to the top-most (highest priority) queue.

Now for each independent scheduling graph snapshot as follows, write down the rule (or rules , using numbers, DO NOT need to repeat the same rule number if applied multiple times within a scheduling graph) that come into play within the snapshot. Note that * marks an arrival if the information is relevant.

Scheduling graph	Rule(s)? (write the numbers) [2 points for each, -0.5 for each error until to 0]
Q3: A* Q2: AA Q1: AAAAAAAAAA	[Note: only A is in the system]
Q3: A* Q2: AA Q1: BBBBBBBB	[Note: B not finished]
Q3: A* Q2: AA Q1: BBBBBBBB AAAABBBB
Q3: AB Q2: AABB Q1: AAABBB AAABBBBB