Using Python

10.28 In this problem, you will develop a function that crawls through linked files. Every file visited by the crawler will contain zero or more links, one per line, to other files and nothing else. A link to a file is just the name of the file. For example, the content of file file0.txt is: file1.txt file2.txt The first line represents the link o file file1.txt and the second is a link to file2.txt. Implement recursive method crawl() that takes as input a file name (as a string), prints a message saying the file is being visited, opens the file, reads each link, and recursively continues the crawl on each link. The below example uses a set of files packaged in archive files.zip. File: files.zip >>> crawl('file0.txt') Visiting file0.txt Visiting file1.txt Visiting file3.txt Visiting file4.txt Visiting file8.txt Visiting file9.txt Visiting file2.txt Visiting file5.txt Visiting file6.txt Visiting file7.txt

10.32 The Lvy curves are fractal graphical patterns that can be defined recursively. Like the Koch curves, for every nonnegative integer n > 0, the Lvy curve Ln can be defined in terms of Lvy curve Ln1; Lvy curve L0 is just a straight line. Figure 10.17 shows the Lvy curve L8. (a) Find more information about the Lvy curve online and use it to implement recursive function levy() that takes a nonnegative integer n and returns turtle instructions encoded with letters L, R and, F, where L means rotate left 45 degrees, R means rotate right 90 degrees, and F means go forward. >>> levy(0) 'F' Lvy curve L8. >>> levy(1) 'LFRFL' >>> levy(2) 'LLFRFLRLFRFLL' (b) Implement function drawLevy()) so that it takes nonnegative integer n as input and draws the Lvy curve Ln using instructions obtained from function levy().