FIT2004_S1_2026_2nd Site PT1 Q3 only reattempt W11/W12

Consider the following algorithm. Assume the input array contains numbers. [table] 1 2 3 4 5 | function F3(array[1..n]) for k = 2 to n do # Invariant here if array[k] < array[k-1] then swap(array[k], ...