Code in R please

Homework Requirements a. Create a structured flowchart of the algorithm. b. Write pseudocode sufficiently complete, clear, and concise enough to enable a person to accurately implement the algorithm in any programming language they are adept with using. c. Write the function(s) which accurately implements the algorithm(s) as described or requested. d. Include the error-handling to ensure your function(s) work properly. 1: Greatest Common Divisor (GCD) Please write a function, god(), which takes two positive integers a, b and calculates their greatest common divisor (GCD) using the Euclidean algorithm. The Euclidean Algorithm Example: Let a = 180 and b = 25 1. calculate 180/25, and get the result 7 with remainder 30, so 180 = 7 * 25 + 5. 2. calculate 25/5, and get the result 5 with remainder 15, so 25 = 5 x 5 +0. 3. the greatest common divisor of 180 and 25 is 5. Based on your god(), please write another function, which takes three positive integers and returns their GCD