Question
Task 1: Recursive Problem Solving Part A: Euclid's Algorithm Re-implement Euclid's algorithm using a recursive functiongcd(a, b). Part B: List Inversion Write a recursive functionreverse(lst)that
Task 1: Recursive Problem Solving
Part A: Euclid's Algorithm
Re-implement Euclid's algorithm using a recursive functiongcd(a, b).
Part B: List Inversion
Write a recursive functionreverse(lst)that computes the reversion oflst. For example:
>>> reverse([1, 2, 3, 4])
[4, 3, 2, 1]
>>> reverse([10, 11, 12, 13, 14]) [14, 13, 12, 11, 10]
- >>>reverse ([1]) [1]
- >>>reverse ([]) []
Part C: Palindromes
Write a recursive functionis pal(string)to check if a string is palindrome. A palindrome string is a string that reads the same form either direction. For example:
>>> is_pal('aa') True
>>> is_pal('aabb') False
>>> is_pal('aba') True
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started