Using Python

Please attempt 10.36 first

10.34 Using linear recursion, implement function recDup() that takes a list as input and returns a copy of it in which every list item has been duplicated. >>> recDup(['ant', 'bat', 'cat', 'dog']) ['ant', 'ant', 'bat', 'bat', 'cat', 'cat', 'dog', 'dog']

10.35 Using linear recursion, implement function recReverse() that takes a list as input and returns a reversed copy of the list. >>> lst = [1, 3, 5, 7, 9] >>> recReverse(lst) [9, 7, 5, 3, 1]

10.36 Using linear recursion, implement function recSplit() that takes, as input, a list lst and a nonnegative integer i no greater than the size of lst. The function should split the list into two parts so that the second part contains exactly the last i items of the list. The function should return a list containing the two parts. >>> recSplit([1, 2, 3, 4, 5, 6, 7], 3) [[1, 2, 3, 4], [5, 6, 7]] 10.37 Implement a function that draws patterns of squares like this: (a) To get started, first implement function square() that takes as input a Turtle object and three integers x, y, and s and makes the Turtle object trace a square of side length s centered at coordinates (x, y). >>> from turtle import Screen, Turtle >>> s = Screen() >>> t = Turtle() >>> t.pensize(2) >>> square(t, 0, 0, 200) #draws the square (b) Now implement recursive function squares() that takes the same inputs as function square plus an integer n and draws a pattern of squares. When n = 0, nothing is drawn. When n = 1, the same square drawn by square(t, 0, 0, 200) is drawn. When n = 2 the pattern is: Each of the four small squares is centered at an endpoint of the large square and has length 1/2.2 of the original square. When n = 3, the pattern is: