Örnek : ОКЕК(24, 32)-? ОВЕВ(24, 32)- ОВЕВ(24, 32-24)- ОВЕВ (24-8, 8)- ОВЕВ(16-8, 8)- ОВЕВ(8, 8)- 8 ОКЕК(24, 32)- (24. 32) /ОВЕВ(24, 32) — 768 /8 -D 96 %3D ÖRNEK PROGRAM ÇIKTI int main() 96 printf("%d",okek(24,32));

Write the function named okek that finds and returns the OKEK (Smallest of Common Multiple) values ​​of two positive integers sent to it according to the method given, in accordance with the example program below. -The OKEK value of the two numbers given is equal to their product divided by the GCD (Largest Middle Divisor) value. OKEK (x, y) = (x. Y) / GCD (x, y) GCD is found as follows: -If the two numbers given are equal, GCD of these two numbers is equal to themselves. (So ​​if x = y GCD (x, y) = x) -If the two numbers given are different, the GCD of these two numbers is equal to the GCD of the number obtained from the difference between small and large and small. (That is, GCD (x, y) = GCD (xy, y) if x> y, and GCD (x, y) = GCD (x, yx) if y> x). continued until the result can be found from the first rule.) Sample : OKEK (24, 32) =? GCD (24, 32) = GCD (24, 32-24) = GCD (24-8, 8) = GCD (16-8, 8) = GCD (8, 8) = 8 OKEK (24, 32) = (24.32) / GCD (24, 32) = 768/8 = 96