A. main: create three arrays, each of signed double-words. the first two will hold integer values that will be sent to the gcd function. each element xi in the first array corresponds with each yi in the second array to form a pair. find the gcd, from the procedure, and store the resulting element zi in the third array. use the pairs (20, 5), (9,7), (432, 226), (24, 18), (49, 7), (339, 9), (63, 9). display each pair and the resulting gcd on the screen each time. b. procedure 1: use recursion to implement euclid's algorithm for finding the gcd (greatest common denominator). the function should accept two integers and return an integer. c. procedure 2: accept two arrays of signed double-words and a third parameter that indicates the length of the two arrays. send it the y array (second parameter) and the z array (gcd result) from the main. for each element yi in the first array, if the corresponding zi in the second array is equal, increment a count. return a count of the number of matching array elements in eax. use the invoke statement to call your procedure and pass stack parameters. create a proto declaration for the procedure. save and restore any registers (other than eax) changed by your procedure. the language used: masm (assembly language for x86 processors)