Program 1 Write a program that prints the first 12 Fibonacci numbers
Sample output:
1
1
2
3
5
8
13
21
34
55
89
144
Program 2 Write GCD both recursively and iteratively
Sample code:
https://www.freecodecamp.org/news/euclidian-gcd-algorithm-greatest-common-divisor/
Your output will simply be the GCD for the pair of numbers. Call your function with a few pairs and note in comments in your code the expected answer. The code must be (reasonably) valid Shank. You cannot use Java, C, JavaScript or some other language.
