Problem 3. Write a complete program that implements the following algorithm that computes the greatest common divisor of two given positive integers. For example, if 441 and 252 are input, then the program should print that 63 is their greatest common divisor:

Algorithm 3.1 The Euclidean Algorithm

To find the greatest common divisor gcd of two positive integers m and n:

1. Subtract m from n repeatedly until n<m.

2. Interchange the values of m and n.

3. Repeats steps 1-2 until m=0

4. Then n is the greatest common divisor of the two original numbers

Problem 4. Write a program that returns the factorial of 150. The output should be 2 3 5 5

Problem 5. Write a program that inputs a positive integer n and then prints a triangle of asterisk n lines high 2n-1 columns wide. For example, if the input is 5 then the output should be.

can give a code for this thanks