Write a Python program in a .py file that includes the following: Convert Euclid’s algorithm to find the greatest common divisor (GCD) of two positive integers to a recursive function named gcd. If you haven't seen Euclid's algorithm before, look in chapter 3 or do some research to see an example before you begin your design.

Create a Python programme that reads a string list from the user and stores it in a dynamic array. The user should be able to insert as many pieces as they want and remove them as needed. Exemplify each sentence, please.

Please answer quickly in python

use The C Programming Language Online Compile for Recamán's Sequence Implement this in a program. Write two functions, one for solving it iteratively, one for solving it recursively. Take two arguments from the command-line: an "i" or "r", and the term number (how many terms to print). Print out which method executed (was selected) and all the terms (and the number of terms).