Assume that n is a power of two. Consider the following sorting algorithm: STRAIGHTEN(A1.. n]) 1: if n = 2 then 2: if A 2A1 then 3: swap A [1]A[2] WEIRDSORT(A[1..n]) end if 1: if n > 1 then 2: WEIRDSORT (A1..?1) 5: else 6: for iltor do 7: 8: end for 9: STRAIGHTEN (All ..3D 10: STRAIGHTEN (Al?+1.n]) 11: STRAIGHTEN (A) 12: end if WEIRDSORT(A +1 .. n]) swap A [i+21+ Ali+2] 4: STRAIGHTEN A1.. n]) 5: end if 1. Give an example proving that WeirDSORT would not correctly sort if we removed lines 6-8 in STRAIGHTEN