Must be written in NASM, GNU x86

4. Greatest Common Divisor C language program that implements Euclid's algorithm: ged(a,b) = gcd(b, a modb) 1 unsigned int gcd (unsigned int a, unsigned int b) neg eax je L3 PROWN if (a == 0 && b == 0) b = 1; else if (b == 0) b = a; else if (a != 0) while (a l= b) if (a