Given the Euclidean Algorithm for computing the GCD of two positive integers, which is presented below in pseudocode: Euclidean Algorithm: gcd(a,b)://a>b>0x=ay=bwhiley>0:r=rem(x,y)x=yy=r Compute: i. gcd(254,32) using Euclidean Algorithm. [4 marks] ii. The integers s and t such as as+bt=gcd(a,b). [7 marks]