These two problems must be done in Matlab:

HomeAssignment 1e (20 points. CLO 1). Write a non-recursive (brute force) function to calculate the greatest common denominator (or greatest common divisor) of two integers a and b called gcdn(a,b). gcdn(a,b) is the largest number that is the divisor for both a and b. For and 6. example, gcdn(12, 6) 6; because 2 x 6 12,1 x 6 -6, and 6 is the largest divisor for both 12 Hint: suppose the function is gcdn(a, b), you can use a for loop for test from a or b down towards 2. The first common divisor you find is the greatest HomeAssignment 1f (20 points, CLO 2). Write a recursive function to calculate the greatest common denominator of two integers a and b-called gcdr(a,b). gcdr(a,b) is the largest common divisor Hint: the principle here is For integers a >= b > 0, gcdr(a. b) - i if b divides a with no remainder otherwise 02 gcd (b,remainder of