Write a function GCD( int A, int B ), when called from main function, returns the GCD (Greatest Common Divisor) of two numbers. Also get two numbers, X and Y from user and call this function to...

My registration number is 689

Extracted text: Write a function GCD( int A, int B ), when called from main function, returns the GCD (Greatest Common Divisor) of two numbers. Also get two numbers, X and Y from user and call this function to calculate GCD and show the result on Monitor. X and Y must be your reg# and 786, respectively. Note: GCD, Greatest Common Divisor: GCD of two numbers is the greatest number which can divide both the numbers. If the smaller of the two numbers can divide the larger number then the GCD is the smaller number. Else starting from 1 to (smaller / 2), check whether the current element divides both the numbers . If yes, then the highest of these devisors is the required GCD.