Can someone help me write this in java swing

write program that calculate Greatest common divisor of two positive numbers: and b. The greatest common divisor (GCD) of two numbers, the largest number that divides both of them without leaving o remainder The Euclidean algorithm is based on the principle that the greatest common divisor of two numbers does not chonge if the lorger number is reploced by its difference with the smaller number Please impiement the iterative and recursive algorithm and compare the efficiency The program offer to the user two possibillties to colculate: Iterative . Recursive cs ksu ISI The Interface to the program should be a GUI that looks similor to the following: The iterative algorithm based on these steps is function gedia, b) while # b OIterative b: b-a; Recursive return a; Example nter a: er Before 1st iteration After 1st iteration After 2nd iteration After 3rd iteration After 4th iteration After 5th iteration After 6th iteration After 7th iteration After 8th iteration 420 96 324 228 96 132 96 36 36 36 Compute sult Efficiency 12 The Efficiency field should contain the number of colls to the recursive method when the recursive option is chosen and the number of iterations of the loop when the iterative option is selected. A more efficient version of the olgorithm shortcuts these steps, instead replacing the larger of the two by its remainder when divided by the smaller of the two (with this version, the algorithm stops when reaching d zero remainder). while (b 0) int r a%b; return a Before 1st iteration After 1st iteration After 2nd iteration After 3rd iteration After 4th iteration 420 96 36 36 12 24 12 0 96