Complete the trace table for the algorithm shown in Figure 1 which sorts a list of three elements in descending order.

Some values have already been entered. You may not need to use all the rows in the table.

Figure 1

1  arr[0] ← 2
2  arr[1] ← 7
3  arr[2] ← 9
4  FOR i ← 0 TO 1
5      FOR j ← 0 TO 1
6          IF arr[j + 1] > arr[j] THEN
7              temp ← arr[j]
8              arr[j] ← arr[j + 1]
9              arr[j + 1] ← temp
10         ENDIF
11     ENDFOR
12 ENDFOR