Find? :=-proc(L::Iist(integer}) local z,i; x := for i from 1 nops(L} do/ I / [i] mod 2 = 0 then r z = 1 or z < L[i] then x := L[i];end if; end if; end do; return x; end proc; 1(b). Modify t e a H :3 U C: (T 91 H [a U] ('T O P'h .4 :23 (T ("T 1-4 2(a). Use the bubble sort to Sort the list 7,6,8, the lists obtained at each step. 2(b). Use the insertion sort to sort the the lists obtained at each step. (I) I convert the decimal expansion of 843 to i) a btnary excansion; ( (ii) an octal expansion; and (iii) a hexadeciu Check each answer by converting back to a decim . v 3(b). Showing all steps, and without use of a calculator, \\ (i) Add using binary arithmetic: 100111; + 1011012 (ii) Multiply using binary arithmetic: 100112 X 110012 lL//@(a). Find the god and the lcm of 23-54-112 and 32-53'7 4(b). Use the Euclidan Algorithm to find gcd (432, 621). 5 . y -:/%(a). List the first five numbers in the sequence of ential .. t, :; r.__pseudorandom numbers generated by the linear congru # ohgenerator Xnu =(4xn + 1) mod 13 with seed Xo - . in AHEAD by translating the letters iven encryption function, and (3p + 2) mod 26 lL//?lb)- Encrypt the message GO .frinto numbers, applying the g , Ethan translating back into letters: r(p)