Procedure foo(k,A) Input: 0 k 1 then do foo(k-1,A) Let A - 8,4,6,3,7,2,5,1 Then, do the following steps print A A :-foo(2,A) print A A:- foo(3,A) print A " (what is the new order of A?) " (what is the new order of A?) " (what is the new order of A?) For any A with aribtrary length n, what is the effect of the following? A - foo(3,foo(2,foo(1,A) "The first (number) elements of A are in (direction) order." Give a big-O estimate for the number of comparisons used to compute A foo(3,foo(2,foo (1,A)) "foo(3,foo(2,foo(1,A))) is O Which sorting algorithm is this? for k:= 1 to n-1 A :- foo(k,A) "This is Sort