(1) 7. Find the Order of Growth of the algorithm. Procedure Foo (a1,a2,, an: distinct integers) even :=0 odd :=0; for x:=1 to n for y:=n downto 1 begin sum:=ax+ay if ( sum mod2=0) even := even +1 ; else odd := odd +1 ; end if (even >odd) return even; else return odd; (1) 8. Find the Order of Growth of the Algorithm. Procedure Foo(x: integer; a1,a2,,an : distinct integers) Low :=0; High :=n; mid :=( low + high )/2 while (amid!=x) begin if (x>amid) low := mid; else high := mid -1 ; mid := (low + high )/2 end return mid;.